Base | Representation |
---|---|
bin | 110111111110001111… |
… | …1000111010110101101 |
3 | 102111020221202101000020 |
4 | 1233330133013112231 |
5 | 3432132213211023 |
6 | 131115201552353 |
7 | 11453446156443 |
oct | 1577437072655 |
9 | 374227671006 |
10 | 120200132013 |
11 | 46a81928285 |
12 | 1b3669456b9 |
13 | b4477b9790 |
14 | 5b63b60b93 |
15 | 31d7838de3 |
hex | 1bfc7c75ad |
120200132013 has 8 divisors (see below), whose sum is σ = 172595061408. Its totient is φ = 73969311984.
The previous prime is 120200131993. The next prime is 120200132027. The reversal of 120200132013 is 310231002021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120200132013 - 226 = 120133023149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120200131983 and 120200132001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120200132513) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1541027295 + ... + 1541027372.
It is an arithmetic number, because the mean of its divisors is an integer number (21574382676).
Almost surely, 2120200132013 is an apocalyptic number.
120200132013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
120200132013 is a deficient number, since it is larger than the sum of its proper divisors (52394929395).
120200132013 is a wasteful number, since it uses less digits than its factorization.
120200132013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3082054683.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 120200132013 its reverse (310231002021), we get a palindrome (430431134034).
The spelling of 120200132013 in words is "one hundred twenty billion, two hundred million, one hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •