Base | Representation |
---|---|
bin | 10011000010011110… |
… | …01111101101001001 |
3 | 222101100012220111200 |
4 | 21201033033231021 |
5 | 131413124233113 |
6 | 4410130214413 |
7 | 511202536530 |
oct | 114117175511 |
9 | 28340186450 |
10 | 10221321033 |
11 | 437573a860 |
12 | 1b93124409 |
13 | c6b7cb271 |
14 | 6cd6d5317 |
15 | 3ec529873 |
hex | 2613cfb49 |
10221321033 has 96 divisors (see below), whose sum is σ = 18980462592. Its totient is φ = 5146156800.
The previous prime is 10221321007. The next prime is 10221321067. The reversal of 10221321033 is 33012312201.
10221321033 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10221321033 - 25 = 10221321001 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10221320997 and 10221321015.
It is not an unprimeable number, because it can be changed into a prime (10221321133) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4630216 + ... + 4632422.
It is an arithmetic number, because the mean of its divisors is an integer number (197713152).
Almost surely, 210221321033 is an apocalyptic number.
It is an amenable number.
10221321033 is a deficient number, since it is larger than the sum of its proper divisors (8759141559).
10221321033 is a wasteful number, since it uses less digits than its factorization.
10221321033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2435 (or 2432 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 10221321033 its reverse (33012312201), we get a palindrome (43233633234).
It can be divided in two parts, 1022132 and 1033, that added together give a triangular number (1023165 = T1430).
The spelling of 10221321033 in words is "ten billion, two hundred twenty-one million, three hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •