Base | Representation |
---|---|
bin | 10100011111100101… |
… | …10100110100010111 |
3 | 1001101202221211110011 |
4 | 22033302310310113 |
5 | 140013103300043 |
6 | 5015431341051 |
7 | 536435566666 |
oct | 121762646427 |
9 | 31352854404 |
10 | 11002400023 |
11 | 4736627a8a |
12 | 2170821787 |
13 | 1064587b94 |
14 | 765336ddd |
15 | 445db559d |
hex | 28fcb4d17 |
11002400023 has 8 divisors (see below), whose sum is σ = 11111315600. Its totient is φ = 10893909888.
The previous prime is 11002400021. The next prime is 11002400047. The reversal of 11002400023 is 32000420011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11002400023 - 21 = 11002400021 is a prime.
It is a super-2 number, since 2×110024000232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11002399976 and 11002400012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002400021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54258 + ... + 157951.
It is an arithmetic number, because the mean of its divisors is an integer number (1388914450).
Almost surely, 211002400023 is an apocalyptic number.
11002400023 is a deficient number, since it is larger than the sum of its proper divisors (108915577).
11002400023 is a wasteful number, since it uses less digits than its factorization.
11002400023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212721.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 11002400023 its reverse (32000420011), we get a palindrome (43002820034).
The spelling of 11002400023 in words is "eleven billion, two million, four hundred thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •