Base | Representation |
---|---|
bin | 1001010010011011011111… |
… | …0001011000111010001101 |
3 | 1100011021112012102121210021 |
4 | 2110212313301120322031 |
5 | 2314304111413041310 |
6 | 33415232421342141 |
7 | 2102544225334000 |
oct | 224466761307215 |
9 | 40137465377707 |
10 | 10212220440205 |
11 | 3287a8422a883 |
12 | 118b243b67951 |
13 | 5910151a20b4 |
14 | 2743ba211537 |
15 | 12a99b17d5da |
hex | 949b7c58e8d |
10212220440205 has 32 divisors (see below), whose sum is σ = 14382180806400. Its totient is φ = 6958062296640.
The previous prime is 10212220440139. The next prime is 10212220440241. The reversal of 10212220440205 is 50204402221201.
It is a happy number.
It is not a de Polignac number, because 10212220440205 - 217 = 10212220309133 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10212220440205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18694591 + ... + 19233100.
It is an arithmetic number, because the mean of its divisors is an integer number (449443150200).
Almost surely, 210212220440205 is an apocalyptic number.
It is an amenable number.
10212220440205 is a deficient number, since it is larger than the sum of its proper divisors (4169960366195).
10212220440205 is an equidigital number, since it uses as much as digits as its factorization.
10212220440205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37927874 (or 37927860 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 25.
Adding to 10212220440205 its reverse (50204402221201), we get a palindrome (60416622661406).
The spelling of 10212220440205 in words is "ten trillion, two hundred twelve billion, two hundred twenty million, four hundred forty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •