Base | Representation |
---|---|
bin | 11101100100011111001… |
… | …101010011111101000110 |
3 | 21012021001120121201021120 |
4 | 131210133031103331012 |
5 | 231243111014124220 |
6 | 4153301400054410 |
7 | 266544631324266 |
oct | 35443715237506 |
9 | 7167046551246 |
10 | 2032043114310 |
11 | 71386a3a9940 |
12 | 2899a7164406 |
13 | 11980bcbaa41 |
14 | 704cc3b77a6 |
15 | 37cd1183a40 |
hex | 1d91f353f46 |
2032043114310 has 128 divisors (see below), whose sum is σ = 5342077440000. Its totient is φ = 490600437120.
The previous prime is 2032043114291. The next prime is 2032043114333. The reversal of 2032043114310 is 134113402302.
It is a happy number.
It is a super-2 number, since 2×20320431143102 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent 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, 80181621 + ... + 80206959.
It is an arithmetic number, because the mean of its divisors is an integer number (41734980000).
Almost surely, 22032043114310 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2032043114310, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2671038720000).
2032043114310 is an abundant number, since it is smaller than the sum of its proper divisors (3310034325690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2032043114310 is a wasteful number, since it uses less digits than its factorization.
2032043114310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26346.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 2032043114310 its reverse (134113402302), we get a palindrome (2166156516612).
The spelling of 2032043114310 in words is "two trillion, thirty-two billion, forty-three million, one hundred fourteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •