Base | Representation |
---|---|
bin | 111000000001100011… |
… | …0111010111100001111 |
3 | 102111112200210202002202 |
4 | 1300003012322330033 |
5 | 3432344133331343 |
6 | 131134211112115 |
7 | 11456265404102 |
oct | 1600306727417 |
9 | 374480722082 |
10 | 120311230223 |
11 | 47029609a88 |
12 | 1b397ba263b |
13 | b464817972 |
14 | 5b74800739 |
15 | 31e2481db8 |
hex | 1c031baf0f |
120311230223 has 8 divisors (see below), whose sum is σ = 122876635392. Its totient is φ = 117746058136.
The previous prime is 120311230211. The next prime is 120311230261. The reversal of 120311230223 is 322032113021.
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 120311230223 - 26 = 120311230159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120311230195 and 120311230204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120311230283) 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, 1337636 + ... + 1424742.
It is an arithmetic number, because the mean of its divisors is an integer number (15359579424).
Almost surely, 2120311230223 is an apocalyptic number.
120311230223 is a deficient number, since it is larger than the sum of its proper divisors (2565405169).
120311230223 is an equidigital number, since it uses as much as digits as its factorization.
120311230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116541.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 120311230223 its reverse (322032113021), we get a palindrome (442343343244).
The spelling of 120311230223 in words is "one hundred twenty billion, three hundred eleven million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •