Base | Representation |
---|---|
bin | 11011010010101010111101… |
… | …001111111000001011110011 |
3 | 120201222210021011010002000202 |
4 | 123102222331033320023303 |
5 | 111213034104231011011 |
6 | 1103141101201505415 |
7 | 34165622333313521 |
oct | 3322527517701363 |
9 | 521883234102022 |
10 | 120030331110131 |
11 | 35277639800182 |
12 | 1156682304226b |
13 | 51c8a72292c10 |
14 | 218d6db469311 |
15 | dd23e738623b |
hex | 6d2abd3f82f3 |
120030331110131 has 8 divisors (see below), whose sum is σ = 129310800134880. Its totient is φ = 110756628747072.
The previous prime is 120030331110127. The next prime is 120030331110197. The reversal of 120030331110131 is 131011133030021.
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 120030331110131 - 22 = 120030331110127 is a prime.
It is a super-2 number, since 2×1200303311101312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (120030331190131) 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, 1691628575 + ... + 1691699528.
It is an arithmetic number, because the mean of its divisors is an integer number (16163850016860).
Almost surely, 2120030331110131 is an apocalyptic number.
120030331110131 is a deficient number, since it is larger than the sum of its proper divisors (9280469024749).
120030331110131 is a wasteful number, since it uses less digits than its factorization.
120030331110131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3383330845.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 120030331110131 its reverse (131011133030021), we get a palindrome (251041464140152).
The spelling of 120030331110131 in words is "one hundred twenty trillion, thirty billion, three hundred thirty-one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •