Base | Representation |
---|---|
bin | 101111000001000111010… |
… | …001010100101010010011 |
3 | 102102212210201110120221000 |
4 | 233001013101110222103 |
5 | 410414102322130003 |
6 | 10512150033433043 |
7 | 452301316314606 |
oct | 57010721245223 |
9 | 12385721416830 |
10 | 3231011130003 |
11 | 103629a606938 |
12 | 44223710b783 |
13 | 1a58b584a337 |
14 | b254b82a33d |
15 | 590a54711a3 |
hex | 2f047454a93 |
3231011130003 has 32 divisors (see below), whose sum is σ = 4990416583680. Its totient is φ = 2064217690080.
The previous prime is 3231011129999. The next prime is 3231011130079. The reversal of 3231011130003 is 3000311101323.
It is a happy number.
3231011130003 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3231011130003 - 22 = 3231011129999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3231011130203) by changing a digit.
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, 26192763 + ... + 26315828.
It is an arithmetic number, because the mean of its divisors is an integer number (155950518240).
Almost surely, 23231011130003 is an apocalyptic number.
3231011130003 is a deficient number, since it is larger than the sum of its proper divisors (1759405453677).
3231011130003 is a wasteful number, since it uses less digits than its factorization.
3231011130003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52508696 (or 52508690 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 3231011130003 its reverse (3000311101323), we get a palindrome (6231322231326).
The spelling of 3231011130003 in words is "three trillion, two hundred thirty-one billion, eleven million, one hundred thirty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •