Base | Representation |
---|---|
bin | 110111111011111001… |
… | …0011110011100001111 |
3 | 102111001110110100221101 |
4 | 1233313302132130033 |
5 | 3432002024234411 |
6 | 131103304443531 |
7 | 11451501245422 |
oct | 1576762363417 |
9 | 374043410841 |
10 | 120121321231 |
11 | 46a413995aa |
12 | 1b3444795a7 |
13 | b434384792 |
14 | 5b574c79b9 |
15 | 31d096c8c1 |
hex | 1bf7c9e70f |
120121321231 has 8 divisors (see below), whose sum is σ = 120831609600. Its totient is φ = 119411880960.
The previous prime is 120121321147. The next prime is 120121321253. The reversal of 120121321231 is 132123121021.
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 120121321231 - 227 = 119987103503 is a prime.
It is a super-2 number, since 2×1201213212312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120121321199 and 120121321208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120121361231) 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, 73215 + ... + 495583.
It is an arithmetic number, because the mean of its divisors is an integer number (15103951200).
Almost surely, 2120121321231 is an apocalyptic number.
120121321231 is a deficient number, since it is larger than the sum of its proper divisors (710288369).
120121321231 is a wasteful number, since it uses less digits than its factorization.
120121321231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424049.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 120121321231 its reverse (132123121021), we get a palindrome (252244442252).
The spelling of 120121321231 in words is "one hundred twenty billion, one hundred twenty-one million, three hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •