Base | Representation |
---|---|
bin | 10010111010110100000… |
… | …000011000001000101100 |
3 | 11121021210012202010121020 |
4 | 102322310000120020230 |
5 | 132300101112334012 |
6 | 2433131401334140 |
7 | 162633456456621 |
oct | 22726400301054 |
9 | 4537705663536 |
10 | 1300100121132 |
11 | 46140769672a |
12 | 18bb74a97350 |
13 | 957a2a81107 |
14 | 46cd49ac348 |
15 | 23c42b00a8c |
hex | 12eb401822c |
1300100121132 has 48 divisors (see below), whose sum is σ = 3108118777344. Its totient is φ = 422720272000.
The previous prime is 1300100121113. The next prime is 1300100121137. The reversal of 1300100121132 is 2311210010031.
It is a happy number.
It is a super-2 number, since 2×13001001211322 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1300100121137) 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, 2514457 + ... + 2987087.
It is an arithmetic number, because the mean of its divisors is an integer number (64752474528).
Almost surely, 21300100121132 is an apocalyptic number.
1300100121132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1300100121132 is an abundant number, since it is smaller than the sum of its proper divisors (1808018656212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300100121132 is a wasteful number, since it uses less digits than its factorization.
1300100121132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478270 (or 478268 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1300100121132 its reverse (2311210010031), we get a palindrome (3611310131163).
The spelling of 1300100121132 in words is "one trillion, three hundred billion, one hundred million, one hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •