Base | Representation |
---|---|
bin | 1010010111101000110010… |
… | …0110111110001101101011 |
3 | 1111100221111101102122222211 |
4 | 2211322030212332031223 |
5 | 2443244130232330443 |
6 | 40125350123425551 |
7 | 2254465263651406 |
oct | 245721446761553 |
9 | 44327441378884 |
10 | 11401202230123 |
11 | 36a624a480622 |
12 | 13417676852b7 |
13 | 649189b57964 |
14 | 2b5b6d288d3d |
15 | 14b8888ce19d |
hex | a5e8c9be36b |
11401202230123 has 8 divisors (see below), whose sum is σ = 11794479246000. Its totient is φ = 11007934021728.
The previous prime is 11401202230063. The next prime is 11401202230139. The reversal of 11401202230123 is 32103220210411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11401202230123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11401202230094 and 11401202230103.
It is not an unprimeable number, because it can be changed into a prime (11401202233123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 487453 + ... + 4800001.
It is an arithmetic number, because the mean of its divisors is an integer number (1474309905750).
Almost surely, 211401202230123 is an apocalyptic number.
11401202230123 is a deficient number, since it is larger than the sum of its proper divisors (393277015877).
11401202230123 is an equidigital number, since it uses as much as digits as its factorization.
11401202230123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4403741.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 11401202230123 its reverse (32103220210411), we get a palindrome (43504422440534).
The spelling of 11401202230123 in words is "eleven trillion, four hundred one billion, two hundred two million, two hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •