Base | Representation |
---|---|
bin | 11110000010010010011… |
… | …00101011101000001001 |
3 | 10122122211021002202001110 |
4 | 33001021030223220021 |
5 | 113402034133242413 |
6 | 2110034210440533 |
7 | 134363265031323 |
oct | 17011114535011 |
9 | 3578737082043 |
10 | 1032020212233 |
11 | 36874a56130a |
12 | 148019593149 |
13 | 7641c063b9a |
14 | 37d42ccc613 |
15 | 1bca28e68c3 |
hex | f04932ba09 |
1032020212233 has 16 divisors (see below), whose sum is σ = 1390780416896. Its totient is φ = 680650145280.
The previous prime is 1032020212231. The next prime is 1032020212241. The reversal of 1032020212233 is 3322120202301.
It is a happy number.
It is not a de Polignac number, because 1032020212233 - 21 = 1032020212231 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1032020212231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1366888 + ... + 1983033.
It is an arithmetic number, because the mean of its divisors is an integer number (86923776056).
Almost surely, 21032020212233 is an apocalyptic number.
It is an amenable number.
1032020212233 is a deficient number, since it is larger than the sum of its proper divisors (358760204663).
1032020212233 is a wasteful number, since it uses less digits than its factorization.
1032020212233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3351024.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 1032020212233 its reverse (3322120202301), we get a palindrome (4354140414534).
It can be divided in two parts, 1032020 and 212233, that added together give a triangular number (1244253 = T1577).
The spelling of 1032020212233 in words is "one trillion, thirty-two billion, twenty million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •