Base | Representation |
---|---|
bin | 1001000110001100011011… |
… | …1010100111100011010100 |
3 | 1022102011222001022210112112 |
4 | 2101203012322213203110 |
5 | 2302333114401321322 |
6 | 33134510504410152 |
7 | 2051423256522122 |
oct | 221430672474324 |
9 | 38364861283475 |
10 | 10002021120212 |
11 | 3206919196600 |
12 | 1156560776958 |
13 | 577256ab8b44 |
14 | 268159724912 |
15 | 1252975c85e2 |
hex | 918c6ea78d4 |
10002021120212 has 72 divisors (see below), whose sum is σ = 19440750346920. Its totient is φ = 4498813440000.
The previous prime is 10002021120211. The next prime is 10002021120269. The reversal of 10002021120212 is 21202112020001.
It can be written as a sum of positive squares in 4 ways, for example, as 126425758096 + 9875595362116 = 355564^2 + 3142546^2 .
It is a super-3 number, since 3×100020211202123 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002021120211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 422567114 + ... + 422590782.
It is an arithmetic number, because the mean of its divisors is an integer number (270010421485).
Almost surely, 210002021120212 is an apocalyptic number.
It is an amenable number.
10002021120212 is a deficient number, since it is larger than the sum of its proper divisors (9438729226708).
10002021120212 is a wasteful number, since it uses less digits than its factorization.
10002021120212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32793 (or 32780 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10002021120212 its reverse (21202112020001), we get a palindrome (31204133140213).
The spelling of 10002021120212 in words is "ten trillion, two billion, twenty-one million, one hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •