Base | Representation |
---|---|
bin | 1111000000110001110111… |
… | …10111101110010001000111 |
3 | 11022212221001121201100001111 |
4 | 13200120323313232101013 |
5 | 13311332312003201411 |
6 | 154113320542505451 |
7 | 6645022120322662 |
oct | 740307367562107 |
9 | 138787047640044 |
10 | 33012123100231 |
11 | a5783a9958430 |
12 | 3851b79295287 |
13 | 1556050774a32 |
14 | 821b1c3866d9 |
15 | 3c3ac39a7721 |
hex | 1e063bdee447 |
33012123100231 has 4 divisors (see below), whose sum is σ = 36013225200264. Its totient is φ = 30011021000200.
The previous prime is 33012123100223. The next prime is 33012123100289. The reversal of 33012123100231 is 13200132121033.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 33012123100231 - 23 = 33012123100223 is a prime.
It is a super-2 number, since 2×330121231002312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33012123100291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1500551050000 + ... + 1500551050021.
It is an arithmetic number, because the mean of its divisors is an integer number (9003306300066).
Almost surely, 233012123100231 is an apocalyptic number.
33012123100231 is a deficient number, since it is larger than the sum of its proper divisors (3001102100033).
33012123100231 is a wasteful number, since it uses less digits than its factorization.
33012123100231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3001102100032.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 33012123100231 its reverse (13200132121033), we get a palindrome (46212255221264).
The spelling of 33012123100231 in words is "thirty-three trillion, twelve billion, one hundred twenty-three million, one hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •