Base | Representation |
---|---|
bin | 1111000000011101100100… |
… | …00111010111110101000111 |
3 | 11022211212220220101200120111 |
4 | 13200032302013113311013 |
5 | 13311143000313342411 |
6 | 154104315130413451 |
7 | 6644155021521214 |
oct | 740166207276507 |
9 | 138755826350514 |
10 | 33001222012231 |
11 | a5738155386a0 |
12 | 384ba36591287 |
13 | 155500419c8c5 |
14 | 8213a66a2b0b |
15 | 3c3686955721 |
hex | 1e03b21d7d47 |
33001222012231 has 8 divisors (see below), whose sum is σ = 36159929288064. Its totient is φ = 29868947433720.
The previous prime is 33001222012229. The next prime is 33001222012261. The reversal of 33001222012231 is 13221022210033.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 33001222012231 - 21 = 33001222012229 is a prime.
It is a super-2 number, since 2×330012220122312 (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 (33001222012261) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6608171715 + ... + 6608176708.
It is an arithmetic number, because the mean of its divisors is an integer number (4519991161008).
Almost surely, 233001222012231 is an apocalyptic number.
33001222012231 is a deficient number, since it is larger than the sum of its proper divisors (3158707275833).
33001222012231 is a wasteful number, since it uses less digits than its factorization.
33001222012231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13216348661.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 33001222012231 its reverse (13221022210033), we get a palindrome (46222244222264).
The spelling of 33001222012231 in words is "thirty-three trillion, one billion, two hundred twenty-two million, twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •