Base | Representation |
---|---|
bin | 11101011101001011101… |
… | …11011111011111101011 |
3 | 10120202101222220022010112 |
4 | 32232211313133133223 |
5 | 113040240111231443 |
6 | 2052541413404535 |
7 | 133056532631465 |
oct | 16564567373753 |
9 | 3522358808115 |
10 | 1012100102123 |
11 | 3602581387a0 |
12 | 14419a33974b |
13 | 745960ab496 |
14 | 36db3481135 |
15 | 1b4d8babb18 |
hex | eba5ddf7eb |
1012100102123 has 4 divisors (see below), whose sum is σ = 1104109202328. Its totient is φ = 920091001920.
The previous prime is 1012100102119. The next prime is 1012100102171. The reversal of 1012100102123 is 3212010012101.
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 1012100102123 - 22 = 1012100102119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012100102098 and 1012100102107.
It is not an unprimeable number, because it can be changed into a prime (1012100104123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46004550086 + ... + 46004550107.
It is an arithmetic number, because the mean of its divisors is an integer number (276027300582).
Almost surely, 21012100102123 is an apocalyptic number.
1012100102123 is a deficient number, since it is larger than the sum of its proper divisors (92009100205).
1012100102123 is an equidigital number, since it uses as much as digits as its factorization.
1012100102123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92009100204.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1012100102123 its reverse (3212010012101), we get a palindrome (4224110114224).
The spelling of 1012100102123 in words is "one trillion, twelve billion, one hundred million, one hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •