Base | Representation |
---|---|
bin | 101100000111000011011… |
… | …001010000010101110101 |
3 | 101201210010122020211001121 |
4 | 230013003121100111311 |
5 | 344130424402340313 |
6 | 10240310005223541 |
7 | 431666464623361 |
oct | 54070331202565 |
9 | 11653118224047 |
10 | 3031230121333 |
11 | a695a041a107 |
12 | 40b580a01bb1 |
13 | 18cac7a0473b |
14 | a69d88722a1 |
15 | 53cb135828d |
hex | 2c1c3650575 |
3031230121333 has 16 divisors (see below), whose sum is σ = 3186318105216. Its totient is φ = 2878086182400.
The previous prime is 3031230121267. The next prime is 3031230121363. The reversal of 3031230121333 is 3331210321303.
It is a cyclic number.
It is not a de Polignac number, because 3031230121333 - 241 = 832206865781 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3031230121298 and 3031230121307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031230121363) 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 15 ways as a sum of consecutive naturals, for example, 84532858 + ... + 84568708.
It is an arithmetic number, because the mean of its divisors is an integer number (199144881576).
Almost surely, 23031230121333 is an apocalyptic number.
It is an amenable number.
3031230121333 is a deficient number, since it is larger than the sum of its proper divisors (155087983883).
3031230121333 is a wasteful number, since it uses less digits than its factorization.
3031230121333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62844.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 3031230121333 its reverse (3331210321303), we get a palindrome (6362440442636).
The spelling of 3031230121333 in words is "three trillion, thirty-one billion, two hundred thirty million, one hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •