Base | Representation |
---|---|
bin | 10010111010111010100… |
… | …100110000011011010110 |
3 | 11121022001220002212112220 |
4 | 102322322210300123112 |
5 | 132300312320233420 |
6 | 2433150335323210 |
7 | 162636265243431 |
oct | 22727244603326 |
9 | 4538056085486 |
10 | 1300210321110 |
11 | 461463914598 |
12 | 18bba5980506 |
13 | 957bc8564bc |
14 | 46d05496818 |
15 | 23c4c61c840 |
hex | 12eba9306d6 |
1300210321110 has 16 divisors (see below), whose sum is σ = 3120504770736. Its totient is φ = 346722752288.
The previous prime is 1300210321103. The next prime is 1300210321129. The reversal of 1300210321110 is 111230120031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1300210321110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21670171989 + ... + 21670172048.
It is an arithmetic number, because the mean of its divisors is an integer number (195031548171).
Almost surely, 21300210321110 is an apocalyptic number.
1300210321110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1300210321110 is an abundant number, since it is smaller than the sum of its proper divisors (1820294449626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300210321110 is a wasteful number, since it uses less digits than its factorization.
1300210321110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43340344047.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1300210321110 its reverse (111230120031), we get a palindrome (1411440441141).
The spelling of 1300210321110 in words is "one trillion, three hundred billion, two hundred ten million, three hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •