Base | Representation |
---|---|
bin | 11101010010000111001… |
… | …101110010011101010001 |
3 | 21010101010120100220112101 |
4 | 131102013031302131101 |
5 | 230432204141430413 |
6 | 4140235520200401 |
7 | 265245666155152 |
oct | 35220715623521 |
9 | 7111116326471 |
10 | 2012313233233 |
11 | 7064653a51a6 |
12 | 285bbb769101 |
13 | 1179b657b0b4 |
14 | 6d579d27929 |
15 | 37528ec2edd |
hex | 1d487372751 |
2012313233233 has 4 divisors (see below), whose sum is σ = 2012316734628. Its totient is φ = 2012309731840.
The previous prime is 2012313233213. The next prime is 2012313233279. The reversal of 2012313233233 is 3323323132102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 420608022849 + 1591705210384 = 648543^2 + 1261628^2 .
It is a cyclic number.
It is not a de Polignac number, because 2012313233233 - 25 = 2012313233201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2012313233213) 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, 663616 + ... + 2113057.
It is an arithmetic number, because the mean of its divisors is an integer number (503079183657).
Almost surely, 22012313233233 is an apocalyptic number.
It is an amenable number.
2012313233233 is a deficient number, since it is larger than the sum of its proper divisors (3501395).
2012313233233 is an equidigital number, since it uses as much as digits as its factorization.
2012313233233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3501394.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 2012313233233 its reverse (3323323132102), we get a palindrome (5335636365335).
The spelling of 2012313233233 in words is "two trillion, twelve billion, three hundred thirteen million, two hundred thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •