Base | Representation |
---|---|
bin | 110111111110111011… |
… | …0010110111011000111 |
3 | 102111022112210022011022 |
4 | 1233331312112323013 |
5 | 3432204042033221 |
6 | 131121340101355 |
7 | 11454144441626 |
oct | 1577566267307 |
9 | 374275708138 |
10 | 120223002311 |
11 | 46a93829055 |
12 | 1b37253485b |
13 | b44c4664b9 |
14 | 5b66bd56bd |
15 | 31d98554ab |
hex | 1bfdd96ec7 |
120223002311 has 8 divisors (see below), whose sum is σ = 125454653280. Its totient is φ = 114991731712.
The previous prime is 120223002307. The next prime is 120223002349. The reversal of 120223002311 is 113200322021.
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 120223002311 - 22 = 120223002307 is a prime.
It is a super-2 number, since 2×1202230023112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120223002311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120223002611) 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, 688151 + ... + 844983.
It is an arithmetic number, because the mean of its divisors is an integer number (15681831660).
Almost surely, 2120223002311 is an apocalyptic number.
120223002311 is a deficient number, since it is larger than the sum of its proper divisors (5231650969).
120223002311 is a wasteful number, since it uses less digits than its factorization.
120223002311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190185.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 120223002311 its reverse (113200322021), we get a palindrome (233423324332).
The spelling of 120223002311 in words is "one hundred twenty billion, two hundred twenty-three million, two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •