Base | Representation |
---|---|
bin | 110111111011101001… |
… | …0110010000111101110 |
3 | 102111000212211021111122 |
4 | 1233313102302013232 |
5 | 3431442412410410 |
6 | 131102410420542 |
7 | 11451340524020 |
oct | 1576722620756 |
9 | 374025737448 |
10 | 120113013230 |
11 | 46a37734691 |
12 | 1b341731752 |
13 | b4327360c2 |
14 | 5b56364010 |
15 | 31ced7ae55 |
hex | 1bf74b21ee |
120113013230 has 32 divisors (see below), whose sum is σ = 255060264960. Its totient is φ = 39853164960.
The previous prime is 120113013193. The next prime is 120113013277. The reversal of 120113013230 is 32310311021.
It is a junction number, because it is equal to n+sod(n) for n = 120113013199 and 120113013208.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27673640 + ... + 27677979.
It is an arithmetic number, because the mean of its divisors is an integer number (7970633280).
Almost surely, 2120113013230 is an apocalyptic number.
120113013230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120113013230 is an abundant number, since it is smaller than the sum of its proper divisors (134947251730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120113013230 is a wasteful number, since it uses less digits than its factorization.
120113013230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55351664.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 120113013230 its reverse (32310311021), we get a palindrome (152423324251).
The spelling of 120113013230 in words is "one hundred twenty billion, one hundred thirteen million, thirteen thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •