Base | Representation |
---|---|
bin | 10001011101100110110… |
… | …101100110000011100011 |
3 | 11020201110112121020110020 |
4 | 101131212311212003203 |
5 | 124130120411413443 |
6 | 2315140535004523 |
7 | 152461433623623 |
oct | 21354665460343 |
9 | 4221415536406 |
10 | 1200021201123 |
11 | 422a20757888 |
12 | 1746a4809743 |
13 | 89213acba54 |
14 | 4211d286883 |
15 | 213369c7583 |
hex | 11766d660e3 |
1200021201123 has 8 divisors (see below), whose sum is σ = 1694147578128. Its totient is φ = 752954479104.
The previous prime is 1200021201121. The next prime is 1200021201139. The reversal of 1200021201123 is 3211021200021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1200021201123 - 21 = 1200021201121 is a prime.
It is a super-2 number, since 2×12000212011232 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1200021201121) 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, 11764913686 + ... + 11764913787.
It is an arithmetic number, because the mean of its divisors is an integer number (211768447266).
Almost surely, 21200021201123 is an apocalyptic number.
1200021201123 is a deficient number, since it is larger than the sum of its proper divisors (494126377005).
1200021201123 is a wasteful number, since it uses less digits than its factorization.
1200021201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23529827493.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1200021201123 its reverse (3211021200021), we get a palindrome (4411042401144).
It can be divided in two parts, 120002 and 1201123, that added together give a triangular number (1321125 = T1625).
The spelling of 1200021201123 in words is "one trillion, two hundred billion, twenty-one million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •