Base | Representation |
---|---|
bin | 110111111011101010… |
… | …0000000010010101111 |
3 | 102111000220102112201122 |
4 | 1233313110000102233 |
5 | 3431443003132143 |
6 | 131102421331155 |
7 | 11451343326356 |
oct | 1576724002257 |
9 | 374026375648 |
10 | 120113333423 |
11 | 46a37933206 |
12 | 1b341866abb |
13 | b432818a75 |
14 | 5b5640899d |
15 | 31cede0c68 |
hex | 1bf75004af |
120113333423 has 4 divisors (see below), whose sum is σ = 120120199320. Its totient is φ = 120106467528.
The previous prime is 120113333399. The next prime is 120113333441. The reversal of 120113333423 is 324333311021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 324333311021 = 1031 ⋅314581291.
It is a cyclic number.
It is not a de Polignac number, because 120113333423 - 214 = 120113317039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120113333392 and 120113333401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120113333443) 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, 3406640 + ... + 3441717.
It is an arithmetic number, because the mean of its divisors is an integer number (30030049830).
Almost surely, 2120113333423 is an apocalyptic number.
120113333423 is a deficient number, since it is larger than the sum of its proper divisors (6865897).
120113333423 is an equidigital number, since it uses as much as digits as its factorization.
120113333423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6865896.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 120113333423 its reverse (324333311021), we get a palindrome (444446644444).
The spelling of 120113333423 in words is "one hundred twenty billion, one hundred thirteen million, three hundred thirty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •