Base | Representation |
---|---|
bin | 101100000110110111000… |
… | …100010011100111011101 |
3 | 101201202121020002100211021 |
4 | 230012313010103213131 |
5 | 344130013431200013 |
6 | 10240233300324141 |
7 | 431661403661020 |
oct | 54066704234735 |
9 | 11652536070737 |
10 | 3031023303133 |
11 | a694a46aa581 |
12 | 40b5236a3651 |
13 | 18ca93c00bc7 |
14 | a69b91d71b7 |
15 | 53c9d103a8d |
hex | 2c1b71139dd |
3031023303133 has 8 divisors (see below), whose sum is σ = 3464659837440. Its totient is φ = 2597545070160.
The previous prime is 3031023303109. The next prime is 3031023303151. The reversal of 3031023303133 is 3313033201303.
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 3031023303133 - 25 = 3031023303101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3031023303098 and 3031023303107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031023303103) 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, 39534298 + ... + 39610891.
It is an arithmetic number, because the mean of its divisors is an integer number (433082479680).
Almost surely, 23031023303133 is an apocalyptic number.
It is an amenable number.
3031023303133 is a deficient number, since it is larger than the sum of its proper divisors (433636534307).
3031023303133 is an equidigital number, since it uses as much as digits as its factorization.
3031023303133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79150667.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 3031023303133 its reverse (3313033201303), we get a palindrome (6344056504436).
The spelling of 3031023303133 in words is "three trillion, thirty-one billion, twenty-three million, three hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •