Base | Representation |
---|---|
bin | 1010000000011101011101… |
… | …0001110000100110011010 |
3 | 1102221212201120222002110211 |
4 | 2200013113101300212122 |
5 | 2420233142342031020 |
6 | 35222415145001334 |
7 | 2213641111240264 |
oct | 240072721604632 |
9 | 42855646862424 |
10 | 11003023002010 |
11 | 35623a0700086 |
12 | 129856218324a |
13 | 61a771800240 |
14 | 2a0798c48b34 |
15 | 141331c9385a |
hex | a01d747099a |
11003023002010 has 64 divisors (see below), whose sum is σ = 22455070848000. Its totient is φ = 3848220721152.
The previous prime is 11003023001981. The next prime is 11003023002047. The reversal of 11003023002010 is 1020032030011.
It is a super-2 number, since 2×110030230020102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 15376666 + ... + 16076314.
It is an arithmetic number, because the mean of its divisors is an integer number (350860482000).
Almost surely, 211003023002010 is an apocalyptic number.
11003023002010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11003023002010 is an abundant number, since it is smaller than the sum of its proper divisors (11452047845990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11003023002010 is a wasteful number, since it uses less digits than its factorization.
11003023002010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706055.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 11003023002010 its reverse (1020032030011), we get a palindrome (12023055032021).
The spelling of 11003023002010 in words is "eleven trillion, three billion, twenty-three million, two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •