Base | Representation |
---|---|
bin | 101100000111000011101… |
… | …001101000100111111101 |
3 | 101201210010221022222000001 |
4 | 230013003221220213331 |
5 | 344130432002240401 |
6 | 10240310241234301 |
7 | 431666546255554 |
oct | 54070351504775 |
9 | 11653127288001 |
10 | 3031234415101 |
11 | a695a2892082 |
12 | 40b582332991 |
13 | 18cac8878c29 |
14 | a69d926cd9b |
15 | 53cb1905601 |
hex | 2c1c3a689fd |
3031234415101 has 8 divisors (see below), whose sum is σ = 3148022693024. Its totient is φ = 2916550430640.
The previous prime is 3031234415023. The next prime is 3031234415147. The reversal of 3031234415101 is 1015144321303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3031234415101 - 233 = 3022644480509 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3031234415101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031234415161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 526070430 + ... + 526076191.
It is an arithmetic number, because the mean of its divisors is an integer number (393502836628).
Almost surely, 23031234415101 is an apocalyptic number.
It is an amenable number.
3031234415101 is a deficient number, since it is larger than the sum of its proper divisors (116788277923).
3031234415101 is a wasteful number, since it uses less digits than its factorization.
3031234415101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1052146731.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 3031234415101 its reverse (1015144321303), we get a palindrome (4046378736404).
The spelling of 3031234415101 in words is "three trillion, thirty-one billion, two hundred thirty-four million, four hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •