Base | Representation |
---|---|
bin | 1111000000110011101110… |
… | …10010101000111011111111 |
3 | 11022220000122002120200221202 |
4 | 13200121313102220323333 |
5 | 13311341332210341111 |
6 | 154114003514050115 |
7 | 6645055614042245 |
oct | 740316722507377 |
9 | 138800562520852 |
10 | 33013120012031 |
11 | a578870661a85 |
12 | 38521b711993b |
13 | 155617c170383 |
14 | 821bb492c795 |
15 | 3c3b31278b3b |
hex | 1e06774a8eff |
33013120012031 has 16 divisors (see below), whose sum is σ = 33786545385600. Its totient is φ = 32248799751168.
The previous prime is 33013120012027. The next prime is 33013120012127. The reversal of 33013120012031 is 13021002131033.
It is a cyclic number.
It is not a de Polignac number, because 33013120012031 - 22 = 33013120012027 is a prime.
It is a super-2 number, since 2×330131200120312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 33013120011994 and 33013120012012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33013120012001) 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, 23131421 + ... + 24517113.
It is an arithmetic number, because the mean of its divisors is an integer number (2111659086600).
Almost surely, 233013120012031 is an apocalyptic number.
33013120012031 is a deficient number, since it is larger than the sum of its proper divisors (773425373569).
33013120012031 is a wasteful number, since it uses less digits than its factorization.
33013120012031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1388978.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 33013120012031 its reverse (13021002131033), we get a palindrome (46034122143064).
The spelling of 33013120012031 in words is "thirty-three trillion, thirteen billion, one hundred twenty million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •