Base | Representation |
---|---|
bin | 101100000111001000010… |
… | …010011111001000101001 |
3 | 101201210100100202112002111 |
4 | 230013020102133020221 |
5 | 344131111412424001 |
6 | 10240322101202321 |
7 | 432001512563113 |
oct | 54071022371051 |
9 | 11653310675074 |
10 | 3031312233001 |
11 | a69632802898 |
12 | 40b5a44003a1 |
13 | 18cb0ba24020 |
14 | a6a057283b3 |
15 | 53cb8677851 |
hex | 2c1c849f229 |
3031312233001 has 4 divisors (see below), whose sum is σ = 3264490097092. Its totient is φ = 2798134368912.
The previous prime is 3031312232903. The next prime is 3031312233007. The reversal of 3031312233001 is 1003322131303.
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 1592835829776 + 1438476403225 = 1262076^2 + 1199365^2 .
It is a cyclic number.
It is not a de Polignac number, because 3031312233001 - 29 = 3031312232489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3031312233007) 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, 116588932026 + ... + 116588932051.
It is an arithmetic number, because the mean of its divisors is an integer number (816122524273).
Almost surely, 23031312233001 is an apocalyptic number.
It is an amenable number.
3031312233001 is a deficient number, since it is larger than the sum of its proper divisors (233177864091).
3031312233001 is a wasteful number, since it uses less digits than its factorization.
3031312233001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233177864090.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3031312233001 its reverse (1003322131303), we get a palindrome (4034634364304).
The spelling of 3031312233001 in words is "three trillion, thirty-one billion, three hundred twelve million, two hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •