Base | Representation |
---|---|
bin | 110111111000101000… |
… | …1100010001000101001 |
3 | 102110202211210102000022 |
4 | 1233301101202020221 |
5 | 3431241034203223 |
6 | 131044402050225 |
7 | 11446003233611 |
oct | 1576121421051 |
9 | 373684712008 |
10 | 120012022313 |
11 | 46995726717 |
12 | 1b313949975 |
13 | b417836571 |
14 | 5b46b95a41 |
15 | 31c607cac8 |
hex | 1bf1462229 |
120012022313 has 8 divisors (see below), whose sum is σ = 130684598400. Its totient is φ = 109775061648.
The previous prime is 120012022303. The next prime is 120012022357. The reversal of 120012022313 is 313220210021.
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 120012022313 - 220 = 120010973737 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120012022291 and 120012022300.
It is not an unprimeable number, because it can be changed into a prime (120012022303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108903281 + ... + 108904382.
It is an arithmetic number, because the mean of its divisors is an integer number (16335574800).
Almost surely, 2120012022313 is an apocalyptic number.
It is an amenable number.
120012022313 is a deficient number, since it is larger than the sum of its proper divisors (10672576087).
120012022313 is a wasteful number, since it uses less digits than its factorization.
120012022313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217807711.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 120012022313 its reverse (313220210021), we get a palindrome (433232232334).
The spelling of 120012022313 in words is "one hundred twenty billion, twelve million, twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •