Base | Representation |
---|---|
bin | 11000100111111101… |
… | …10000101000010110 |
3 | 1021010022222201212012 |
4 | 30103332300220112 |
5 | 204033322333420 |
6 | 10023453024222 |
7 | 645415114100 |
oct | 142376605026 |
9 | 37108881765 |
10 | 13220121110 |
11 | 5674460729 |
12 | 268b485072 |
13 | 1328b82591 |
14 | 8d5aa8570 |
15 | 525932dc5 |
hex | 313fb0a16 |
13220121110 has 24 divisors (see below), whose sum is σ = 27681315840. Its totient is φ = 4532612784.
The previous prime is 13220121071. The next prime is 13220121137. The reversal of 13220121110 is 1112102231.
13220121110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13489430 + ... + 13490409.
It is an arithmetic number, because the mean of its divisors is an integer number (1153388160).
Almost surely, 213220121110 is an apocalyptic number.
13220121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13220121110 is an abundant number, since it is smaller than the sum of its proper divisors (14461194730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13220121110 is a wasteful number, since it uses less digits than its factorization.
13220121110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26979860 (or 26979853 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 13220121110 its reverse (1112102231), we get a palindrome (14332223341).
The spelling of 13220121110 in words is "thirteen billion, two hundred twenty million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •