Base | Representation |
---|---|
bin | 11110000100001000101… |
… | …00111001100100000100 |
3 | 10122202101101202001220210 |
4 | 33002010110321210010 |
5 | 113411102112102322 |
6 | 2110320444555420 |
7 | 134430002003565 |
oct | 17020424714404 |
9 | 3582341661823 |
10 | 1033012222212 |
11 | 369109518073 |
12 | 148255852b70 |
13 | 76549734339 |
14 | 37dd895a16c |
15 | 1bd0ea4a70c |
hex | f084539904 |
1033012222212 has 24 divisors (see below), whose sum is σ = 2552147843616. Its totient is φ = 324082265728.
The previous prime is 1033012222211. The next prime is 1033012222261. The reversal of 1033012222212 is 2122222103301.
It is a super-2 number, since 2×10330122222122 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1033012222211) 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, 2531892498 + ... + 2531892905.
It is an arithmetic number, because the mean of its divisors is an integer number (106339493484).
Almost surely, 21033012222212 is an apocalyptic number.
1033012222212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1033012222212 is an abundant number, since it is smaller than the sum of its proper divisors (1519135621404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033012222212 is a wasteful number, since it uses less digits than its factorization.
1033012222212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5063785427 (or 5063785425 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1033012222212 its reverse (2122222103301), we get a palindrome (3155234325513).
The spelling of 1033012222212 in words is "one trillion, thirty-three billion, twelve million, two hundred twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •