Base | Representation |
---|---|
bin | 110111111000010101… |
… | …1010110000010110001 |
3 | 102110202010221210111112 |
4 | 1233300223112002301 |
5 | 3431231003330223 |
6 | 131043403323105 |
7 | 11445522160202 |
oct | 1576053260261 |
9 | 373663853445 |
10 | 120002011313 |
11 | 46990009268 |
12 | 1b310520495 |
13 | b41573c9b2 |
14 | 5b4570b5a9 |
15 | 31c5251778 |
hex | 1bf0ad60b1 |
120002011313 has 8 divisors (see below), whose sum is σ = 125075698176. Its totient is φ = 115003490400.
The previous prime is 120002011183. The next prime is 120002011321. The reversal of 120002011313 is 313110200021.
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 120002011313 - 28 = 120002011057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120002001313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18788228 + ... + 18794613.
It is an arithmetic number, because the mean of its divisors is an integer number (15634462272).
Almost surely, 2120002011313 is an apocalyptic number.
It is an amenable number.
120002011313 is a deficient number, since it is larger than the sum of its proper divisors (5073686863).
120002011313 is a wasteful number, since it uses less digits than its factorization.
120002011313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37582975.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 120002011313 its reverse (313110200021), we get a palindrome (433112211334).
The spelling of 120002011313 in words is "one hundred twenty billion, two million, eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •