Base | Representation |
---|---|
bin | 1010000000111111101001… |
… | …1010000101000010000011 |
3 | 1102222202102022110202112022 |
4 | 2200033322122011002003 |
5 | 2420410442243220003 |
6 | 35230534053352055 |
7 | 2214414432166313 |
oct | 240177232050203 |
9 | 42882368422468 |
10 | 11012202320003 |
11 | 35662811385a5 |
12 | 129a2a433862b |
13 | 61b5a5475b51 |
14 | 2a0dc9dbb443 |
15 | 1416bca91738 |
hex | a03fa685083 |
11012202320003 has 8 divisors (see below), whose sum is σ = 11661133219488. Its totient is φ = 10363399675264.
The previous prime is 11012202319997. The next prime is 11012202320011. The reversal of 11012202320003 is 30002320221011.
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 11012202320003 - 238 = 10737324413059 is a prime.
It is a super-2 number, since 2×110122023200032 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11012202320503) 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, 31886876 + ... + 32230377.
It is an arithmetic number, because the mean of its divisors is an integer number (1457641652436).
Almost surely, 211012202320003 is an apocalyptic number.
11012202320003 is a deficient number, since it is larger than the sum of its proper divisors (648930899485).
11012202320003 is a wasteful number, since it uses less digits than its factorization.
11012202320003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64127373.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11012202320003 its reverse (30002320221011), we get a palindrome (41014522541014).
The spelling of 11012202320003 in words is "eleven trillion, twelve billion, two hundred two million, three hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •