Base | Representation |
---|---|
bin | 111000000100001111… |
… | …0111100011111110101 |
3 | 102111202222111120011120 |
4 | 1300020132330133311 |
5 | 3433040230223013 |
6 | 131151152054153 |
7 | 11461442064000 |
oct | 1601036743765 |
9 | 374688446146 |
10 | 120401414133 |
11 | 47075506540 |
12 | 1b402234359 |
13 | b47a402520 |
14 | 5b82798537 |
15 | 31ea348123 |
hex | 1c087bc7f5 |
120401414133 has 64 divisors (see below), whose sum is σ = 219942912000. Its totient is φ = 57734873280.
The previous prime is 120401414117. The next prime is 120401414149. The reversal of 120401414133 is 331414104021.
It is an interprime number because it is at equal distance from previous prime (120401414117) and next prime (120401414149).
It is not a de Polignac number, because 120401414133 - 24 = 120401414117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120401414113) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 261973 + ... + 556266.
It is an arithmetic number, because the mean of its divisors is an integer number (3436608000).
Almost surely, 2120401414133 is an apocalyptic number.
120401414133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
120401414133 is a deficient number, since it is larger than the sum of its proper divisors (99541497867).
120401414133 is a wasteful number, since it uses less digits than its factorization.
120401414133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 818287 (or 818273 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 120401414133 its reverse (331414104021), we get a palindrome (451815518154).
The spelling of 120401414133 in words is "one hundred twenty billion, four hundred one million, four hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •