Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …100111001001111101011 |
3 | 10220011022201201002220112 |
4 | 100000131310321033223 |
5 | 121010311040024003 |
6 | 2201201043244535 |
7 | 142321216002122 |
oct | 20003564711753 |
9 | 3804281632815 |
10 | 1100012033003 |
11 | 39457012a624 |
12 | 15923397974b |
13 | 7c96642c2b0 |
14 | 3b352d1aab9 |
15 | 1d931a7b3d8 |
hex | 1001dd393eb |
1100012033003 has 8 divisors (see below), whose sum is σ = 1185816550128. Its totient is φ = 1014377259744.
The previous prime is 1100012032997. The next prime is 1100012033011. The reversal of 1100012033003 is 3003302100011.
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-1100012033003 is a prime.
It is a super-2 number, since 2×11000120330032 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100012033083) 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, 42422501 + ... + 42448422.
It is an arithmetic number, because the mean of its divisors is an integer number (148227068766).
Almost surely, 21100012033003 is an apocalyptic number.
1100012033003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1100012033003 is a deficient number, since it is larger than the sum of its proper divisors (85804517125).
1100012033003 is an equidigital number, since it uses as much as digits as its factorization.
1100012033003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84871933.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 1100012033003 its reverse (3003302100011), we get a palindrome (4103314133014).
The spelling of 1100012033003 in words is "one trillion, one hundred billion, twelve million, thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •