Base | Representation |
---|---|
bin | 11101101110010111011… |
… | …10000100010001000110 |
3 | 10121122012220100202100100 |
4 | 32313023232010101012 |
5 | 113213133211200402 |
6 | 2101105033224530 |
7 | 133534250053356 |
oct | 16671356042106 |
9 | 3548186322310 |
10 | 1021325100102 |
11 | 36416143626a |
12 | 145b33862146 |
13 | 75406359078 |
14 | 3760a704b66 |
15 | 1b8789ce71c |
hex | edcbb84446 |
1021325100102 has 36 divisors (see below), whose sum is σ = 2265530034924. Its totient is φ = 332524440360.
The previous prime is 1021325100079. The next prime is 1021325100119. The reversal of 1021325100102 is 2010015231201.
1021325100102 is a `hidden beast` number, since 1 + 0 + 21 + 32 + 510 + 0 + 102 = 666.
1021325100102 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×10213251001023 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 15310224 + ... + 15376787.
It is an arithmetic number, because the mean of its divisors is an integer number (62931389859).
Almost surely, 21021325100102 is an apocalyptic number.
1021325100102 is an abundant number, since it is smaller than the sum of its proper divisors (1244204934822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021325100102 is a wasteful number, since it uses less digits than its factorization.
1021325100102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30687105 (or 30687059 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The spelling of 1021325100102 in words is "one trillion, twenty-one billion, three hundred twenty-five million, one hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •