Base | Representation |
---|---|
bin | 111000000111101000… |
… | …1110101111111100011 |
3 | 102112001221000122222221 |
4 | 1300033101311333203 |
5 | 3433303421421011 |
6 | 131210343411511 |
7 | 11464325112001 |
oct | 1601721657743 |
9 | 375057018887 |
10 | 120515420131 |
11 | 471238a3977 |
12 | 1b434453b97 |
13 | b497c0b0b2 |
14 | 5b93993a71 |
15 | 3205367971 |
hex | 1c0f475fe3 |
120515420131 has 8 divisors (see below), whose sum is σ = 129952443600. Its totient is φ = 111387807360.
The previous prime is 120515420099. The next prime is 120515420143. The reversal of 120515420131 is 131024515021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120515420131 - 25 = 120515420099 is a prime.
It is a super-2 number, since 2×1205154201312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120515420096 and 120515420105.
It is not an unprimeable number, because it can be changed into a prime (120518420131) 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, 77351866 + ... + 77353423.
It is an arithmetic number, because the mean of its divisors is an integer number (16244055450).
Almost surely, 2120515420131 is an apocalyptic number.
120515420131 is a deficient number, since it is larger than the sum of its proper divisors (9437023469).
120515420131 is a wasteful number, since it uses less digits than its factorization.
120515420131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154705349.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 120515420131 its reverse (131024515021), we get a palindrome (251539935152).
The spelling of 120515420131 in words is "one hundred twenty billion, five hundred fifteen million, four hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •