Base | Representation |
---|---|
bin | 11101001010110011011… |
… | …00110110110111000010 |
3 | 10112210221021220120210220 |
4 | 32211121230312313002 |
5 | 112410032432424414 |
6 | 2044230312403510 |
7 | 132260152041030 |
oct | 16453154666702 |
9 | 3483837816726 |
10 | 1002232311234 |
11 | 357054014410 |
12 | 1422a56a6596 |
13 | 7368290116b |
14 | 36718ad5550 |
15 | 1b10c716ca9 |
hex | e959b36dc2 |
1002232311234 has 128 divisors (see below), whose sum is σ = 2542274242560. Its totient is φ = 255822873600.
The previous prime is 1002232311203. The next prime is 1002232311253. The reversal of 1002232311234 is 4321132322001.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 146671882 + ... + 146678714.
It is an arithmetic number, because the mean of its divisors is an integer number (19861517520).
Almost surely, 21002232311234 is an apocalyptic number.
1002232311234 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1002232311234, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1271137121280).
1002232311234 is an abundant number, since it is smaller than the sum of its proper divisors (1540041931326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002232311234 is a wasteful number, since it uses less digits than its factorization.
1002232311234 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12296.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1002232311234 its reverse (4321132322001), we get a palindrome (5323364633235).
The spelling of 1002232311234 in words is "one trillion, two billion, two hundred thirty-two million, three hundred eleven thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •