Base | Representation |
---|---|
bin | 1001100011110010110110… |
… | …10000100000011000010100 |
3 | 2202102121010200010210202011 |
4 | 10301321123100200120110 |
5 | 10223402203324001322 |
6 | 112412543244154004 |
7 | 4266503323224655 |
oct | 461713320403024 |
9 | 82377120123664 |
10 | 21021101000212 |
11 | 6774aa954a785 |
12 | 2436044238904 |
13 | b96387098201 |
14 | 5295d8ca952c |
15 | 266c18d4a677 |
hex | 131e5b420614 |
21021101000212 has 24 divisors (see below), whose sum is σ = 36949496630760. Its totient is φ = 10464144998400.
The previous prime is 21021101000209. The next prime is 21021101000243. The reversal of 21021101000212 is 21200010112012.
It can be written as a sum of positive squares in 4 ways, for example, as 493079222416 + 20528021777796 = 702196^2 + 4530786^2 .
It is a super-2 number, since 2×210211010002122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21021101000192 and 21021101000201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3424137 + ... + 7332592.
It is an arithmetic number, because the mean of its divisors is an integer number (1539562359615).
Almost surely, 221021101000212 is an apocalyptic number.
It is an amenable number.
21021101000212 is a deficient number, since it is larger than the sum of its proper divisors (15928395630548).
21021101000212 is a wasteful number, since it uses less digits than its factorization.
21021101000212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10758891 (or 10758889 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21021101000212 its reverse (21200010112012), we get a palindrome (42221111112224).
The spelling of 21021101000212 in words is "twenty-one trillion, twenty-one billion, one hundred one million, two hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •