Base | Representation |
---|---|
bin | 101100000111110001111… |
… | …100011101100001101000 |
3 | 101201212011001210202120001 |
4 | 230013301330131201220 |
5 | 344134024320233222 |
6 | 10240515304312344 |
7 | 432025030065013 |
oct | 54076174354150 |
9 | 11655131722501 |
10 | 3032011102312 |
11 | a6996124a735 |
12 | 40b75a4726b4 |
13 | 18cbc075886a |
14 | a6a7048a37a |
15 | 53d09bc4e27 |
hex | 2c1f1f1d868 |
3032011102312 has 64 divisors (see below), whose sum is σ = 5892034659840. Its totient is φ = 1461200083200.
The previous prime is 3032011102273. The next prime is 3032011102313. The reversal of 3032011102312 is 2132011102303.
3032011102312 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 3032011102312.
It is not an unprimeable number, because it can be changed into a prime (3032011102313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 196531543 + ... + 196546969.
It is an arithmetic number, because the mean of its divisors is an integer number (92063041560).
Almost surely, 23032011102312 is an apocalyptic number.
It is an amenable number.
3032011102312 is a deficient number, since it is larger than the sum of its proper divisors (2860023557528).
3032011102312 is a wasteful number, since it uses less digits than its factorization.
3032011102312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18602 (or 18598 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 3032011102312 its reverse (2132011102303), we get a palindrome (5164022204615).
Subtracting from 3032011102312 its reverse (2132011102303), we obtain a palindrome (900000000009).
The spelling of 3032011102312 in words is "three trillion, thirty-two billion, eleven million, one hundred two thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •