Base | Representation |
---|---|
bin | 10000100000100000101… |
… | …110000110011011010010 |
3 | 11000110010200222021221120 |
4 | 100200200232012123102 |
5 | 122041243100301002 |
6 | 2225051232303110 |
7 | 144646664431362 |
oct | 20404056063322 |
9 | 4013120867846 |
10 | 1134420322002 |
11 | 3a8117774400 |
12 | 163a370a1a96 |
13 | 82c8ab9a206 |
14 | 3cc989da9a2 |
15 | 1e7976c9cbc |
hex | 10820b866d2 |
1134420322002 has 192 divisors, whose sum is σ = 2632234026240. Its totient is φ = 325238538240.
The previous prime is 1134420321997. The next prime is 1134420322019. The reversal of 1134420322002 is 2002230244311.
It is a happy number.
It is a super-2 number, since 2×11344203220022 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 210347818 + ... + 210353210.
It is an arithmetic number, because the mean of its divisors is an integer number (13709552220).
Almost surely, 21134420322002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1134420322002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1316117013120).
1134420322002 is an abundant number, since it is smaller than the sum of its proper divisors (1497813704238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1134420322002 is a wasteful number, since it uses less digits than its factorization.
1134420322002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5649 (or 5638 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 1134420322002 its reverse (2002230244311), we get a palindrome (3136650566313).
The spelling of 1134420322002 in words is "one trillion, one hundred thirty-four billion, four hundred twenty million, three hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •