Base | Representation |
---|---|
bin | 10001011101100110010… |
… | …010111000001000011011 |
3 | 11020201102220110212020011 |
4 | 101131212102320020123 |
5 | 124130111044200443 |
6 | 2315140011542351 |
7 | 152461263360244 |
oct | 21354622701033 |
9 | 4221386425204 |
10 | 1200012100123 |
11 | 422a166010a1 |
12 | 1746a175a9b7 |
13 | 89211c63445 |
14 | 4211bd97ccb |
15 | 21335ccab9d |
hex | 117664b821b |
1200012100123 has 4 divisors (see below), whose sum is σ = 1200015754920. Its totient is φ = 1200008445328.
The previous prime is 1200012100109. The next prime is 1200012100247. The reversal of 1200012100123 is 3210012100021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1200012100123 - 213 = 1200012091931 is a prime.
It is a super-2 number, since 2×12000121001232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1200012100423) 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 3 ways as a sum of consecutive naturals, for example, 1280290 + ... + 2009767.
It is an arithmetic number, because the mean of its divisors is an integer number (300003938730).
Almost surely, 21200012100123 is an apocalyptic number.
1200012100123 is a deficient number, since it is larger than the sum of its proper divisors (3654797).
1200012100123 is an equidigital number, since it uses as much as digits as its factorization.
1200012100123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3654796.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 1200012100123 its reverse (3210012100021), we get a palindrome (4410024200144).
The spelling of 1200012100123 in words is "one trillion, two hundred billion, twelve million, one hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •