Base | Representation |
---|---|
bin | 1001001100001110000111… |
… | …00000100100000010010010 |
3 | 2122120011101101122122111212 |
4 | 10212013003200210002102 |
5 | 10122114313403033020 |
6 | 110552503545540122 |
7 | 4154126633550500 |
oct | 446070340440222 |
9 | 78504341578455 |
10 | 20211101221010 |
11 | 6492530811957 |
12 | 2325068aa4642 |
13 | b37b8b4aaa2b |
14 | 4dc31883b670 |
15 | 250b0cbe0cc5 |
hex | 1261c3824092 |
20211101221010 has 24 divisors (see below), whose sum is σ = 42319571129100. Its totient is φ = 6929520418464.
The previous prime is 20211101220983. The next prime is 20211101221019. The reversal of 20211101221010 is 1012210111202.
It can be written as a sum of positive squares in 2 ways, for example, as 17855450276041 + 2355650944969 = 4225571^2 + 1534813^2 .
It is a super-2 number, since 2×202111012210102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is not an unprimeable number, because it can be changed into a prime (20211101221019) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20623572185 + ... + 20623573164.
Almost surely, 220211101221010 is an apocalyptic number.
20211101221010 is an abundant number, since it is smaller than the sum of its proper divisors (22108469908090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20211101221010 is a wasteful number, since it uses less digits than its factorization.
20211101221010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41247145370 (or 41247145363 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20211101221010 its reverse (1012210111202), we get a palindrome (21223311332212).
The spelling of 20211101221010 in words is "twenty trillion, two hundred eleven billion, one hundred one million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •