Base | Representation |
---|---|
bin | 11101101101110011010… |
… | …10001101111110011000 |
3 | 10121121102210012211021012 |
4 | 32312321222031332120 |
5 | 113212023124221100 |
6 | 2101015011033052 |
7 | 133523610444260 |
oct | 16667152157630 |
9 | 3547383184235 |
10 | 1021022101400 |
11 | 3640163a3914 |
12 | 145a6a29b788 |
13 | 7538864b3b2 |
14 | 375bc3907a0 |
15 | 1b85c0cc135 |
hex | edb9a8df98 |
1021022101400 has 48 divisors (see below), whose sum is σ = 2713001587440. Its totient is φ = 350064720000.
The previous prime is 1021022101399. The next prime is 1021022101423. The reversal of 1021022101400 is 41012201201.
It is a happy number.
It is a super-2 number, since 2×10210221014002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 364649351 + ... + 364652150.
It is an arithmetic number, because the mean of its divisors is an integer number (56520866405).
Almost surely, 21021022101400 is an apocalyptic number.
1021022101400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1021022101400 is an abundant number, since it is smaller than the sum of its proper divisors (1691979486040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1021022101400 is a wasteful number, since it uses less digits than its factorization.
1021022101400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 729301524 (or 729301515 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1021022101400 its reverse (41012201201), we get a palindrome (1062034302601).
The spelling of 1021022101400 in words is "one trillion, twenty-one billion, twenty-two million, one hundred one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •