Base | Representation |
---|---|
bin | 1001101001010110100111… |
… | …10000011100100011100100 |
3 | 2210002212010210201021102111 |
4 | 10310223103300130203210 |
5 | 10240014340401400400 |
6 | 113040412121250404 |
7 | 4316344433152456 |
oct | 464532360344344 |
9 | 83085123637374 |
10 | 21212101200100 |
11 | 6839002146948 |
12 | 2467069933a04 |
13 | bab3a59a7075 |
14 | 5349579c82d6 |
15 | 26bb971323ba |
hex | 134ad3c1c8e4 |
21212101200100 has 18 divisors (see below), whose sum is σ = 46030259604434. Its totient is φ = 8484840480000.
The previous prime is 21212101200079. The next prime is 21212101200131. The reversal of 21212101200100 is 100210121212.
It can be written as a sum of positive squares in 3 ways, for example, as 2814590050276 + 18397511149824 = 1677674^2 + 4289232^2 .
It is a super-3 number, since 3×212121012001003 (a number of 41 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 106060505901 + ... + 106060506100.
Almost surely, 221212101200100 is an apocalyptic number.
21212101200100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21212101200100 is an abundant number, since it is smaller than the sum of its proper divisors (24818158404334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21212101200100 is a wasteful number, since it uses less digits than its factorization.
21212101200100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212121012015 (or 212121012008 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21212101200100 its reverse (100210121212), we get a palindrome (21312311321312).
The spelling of 21212101200100 in words is "twenty-one trillion, two hundred twelve billion, one hundred one million, two hundred thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •