Base | Representation |
---|---|
bin | 10001011110101000010… |
… | …101100100011010000111 |
3 | 11020211022010101012002120 |
4 | 101132220111210122013 |
5 | 124134343221231043 |
6 | 2315441552141023 |
7 | 152530606261422 |
oct | 21365025443207 |
9 | 4224263335076 |
10 | 1201120102023 |
11 | 423434a91346 |
12 | 174950837773 |
13 | 8935a68637a |
14 | 421c51ba9b9 |
15 | 2139d1e2983 |
hex | 117a8564687 |
1201120102023 has 8 divisors (see below), whose sum is σ = 1601499463536. Its totient is φ = 800743737600.
The previous prime is 1201120101991. The next prime is 1201120102027. The reversal of 1201120102023 is 3202010211021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1201120102023 - 25 = 1201120101991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1201120101993 and 1201120102011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201120102027) 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, 468663 + ... + 1619223.
It is an arithmetic number, because the mean of its divisors is an integer number (200187432942).
Almost surely, 21201120102023 is an apocalyptic number.
1201120102023 is a deficient number, since it is larger than the sum of its proper divisors (400379361513).
1201120102023 is a wasteful number, since it uses less digits than its factorization.
1201120102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1498545.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1201120102023 its reverse (3202010211021), we get a palindrome (4403130313044).
The spelling of 1201120102023 in words is "one trillion, two hundred one billion, one hundred twenty million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •