Base | Representation |
---|---|
bin | 110111111001001101… |
… | …1000111110011010111 |
3 | 102110211012002111000022 |
4 | 1233302123013303113 |
5 | 3431311004004421 |
6 | 131050331335355 |
7 | 11446326220163 |
oct | 1576233076327 |
9 | 373735074008 |
10 | 120031313111 |
11 | 469a5602126 |
12 | 1b31a2b155b |
13 | b41b82bc38 |
14 | 5b49577ca3 |
15 | 31c7add7ab |
hex | 1bf26c7cd7 |
120031313111 has 4 divisors (see below), whose sum is σ = 121153101192. Its totient is φ = 118909525032.
The previous prime is 120031313069. The next prime is 120031313119. The reversal of 120031313111 is 111313130021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120031313111 - 26 = 120031313047 is a prime.
It is a super-2 number, since 2×1200313131112 (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 120031313111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120031313119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 560893880 + ... + 560894093.
It is an arithmetic number, because the mean of its divisors is an integer number (30288275298).
Almost surely, 2120031313111 is an apocalyptic number.
120031313111 is a deficient number, since it is larger than the sum of its proper divisors (1121788081).
120031313111 is a wasteful number, since it uses less digits than its factorization.
120031313111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1121788080.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 120031313111 its reverse (111313130021), we get a palindrome (231344443132).
The spelling of 120031313111 in words is "one hundred twenty billion, thirty-one million, three hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •