Base | Representation |
---|---|
bin | 1100000110001110111000… |
… | …0101101101000010010010 |
3 | 1202002120202102022120101002 |
4 | 3001203232011231002102 |
5 | 3220411341041033020 |
6 | 44142254253142002 |
7 | 2541660314625401 |
oct | 301435605550222 |
9 | 52076672276332 |
10 | 13301213221010 |
11 | 4269016112990 |
12 | 15a9a4548a902 |
13 | 7563b6c5a180 |
14 | 33dad4339638 |
15 | 180edd5e3975 |
hex | c18ee16d092 |
13301213221010 has 64 divisors (see below), whose sum is σ = 28219502957184. Its totient is φ = 4450199616000.
The previous prime is 13301213220959. The next prime is 13301213221013. The reversal of 13301213221010 is 1012231210331.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (13301213221013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14710091 + ... + 15588110.
It is an arithmetic number, because the mean of its divisors is an integer number (440929733706).
Almost surely, 213301213221010 is an apocalyptic number.
13301213221010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13301213221010 is an abundant number, since it is smaller than the sum of its proper divisors (14918289736174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13301213221010 is a wasteful number, since it uses less digits than its factorization.
13301213221010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30298539.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13301213221010 its reverse (1012231210331), we get a palindrome (14313444431341).
The spelling of 13301213221010 in words is "thirteen trillion, three hundred one billion, two hundred thirteen million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •