Base | Representation |
---|---|
bin | 10010111010110101010… |
… | …011111011000011011110 |
3 | 11121021211201221211002120 |
4 | 102322311103323003132 |
5 | 132300122214201420 |
6 | 2433133503003410 |
7 | 162634143564102 |
oct | 22726523730336 |
9 | 4537751854076 |
10 | 1300122022110 |
11 | 461418a9520a |
12 | 18bb80299566 |
13 | 957a747b882 |
14 | 46cd786d902 |
15 | 23c449c9d40 |
hex | 12eb54fb0de |
1300122022110 has 32 divisors (see below), whose sum is σ = 3204625095072. Its totient is φ = 337328956800.
The previous prime is 1300122022099. The next prime is 1300122022117. The reversal of 1300122022110 is 112202210031.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1300122022110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300122022117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 585639441 + ... + 585641660.
It is an arithmetic number, because the mean of its divisors is an integer number (100144534221).
Almost surely, 21300122022110 is an apocalyptic number.
1300122022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1300122022110 is an abundant number, since it is smaller than the sum of its proper divisors (1904503072962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300122022110 is a wasteful number, since it uses less digits than its factorization.
1300122022110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1171281148.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1300122022110 its reverse (112202210031), we get a palindrome (1412324232141).
The spelling of 1300122022110 in words is "one trillion, three hundred billion, one hundred twenty-two million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •