Base | Representation |
---|---|
bin | 110111111110111011… |
… | …0110110011011000011 |
3 | 102111022120000212010211 |
4 | 1233331312312123003 |
5 | 3432204110200311 |
6 | 131121342534551 |
7 | 11454145520032 |
oct | 1577566663303 |
9 | 374276025124 |
10 | 120223131331 |
11 | 46a93906a86 |
12 | 1b372597457 |
13 | b44c4b0144 |
14 | 5b66c2a719 |
15 | 31d987d821 |
hex | 1bfddb66c3 |
120223131331 has 4 divisors (see below), whose sum is σ = 121744943200. Its totient is φ = 118701319464.
The previous prime is 120223131323. The next prime is 120223131359. The reversal of 120223131331 is 133131322021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 133131322021 = 103 ⋅1292537107.
It is a cyclic number.
It is not a de Polignac number, because 120223131331 - 23 = 120223131323 is a prime.
It is a super-2 number, since 2×1202231313312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120223131631) 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, 760905816 + ... + 760905973.
It is an arithmetic number, because the mean of its divisors is an integer number (30436235800).
Almost surely, 2120223131331 is an apocalyptic number.
120223131331 is a deficient number, since it is larger than the sum of its proper divisors (1521811869).
120223131331 is an equidigital number, since it uses as much as digits as its factorization.
120223131331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1521811868.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 120223131331 its reverse (133131322021), we get a palindrome (253354453352).
The spelling of 120223131331 in words is "one hundred twenty billion, two hundred twenty-three million, one hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •