Base | Representation |
---|---|
bin | 10110111110001011100111… |
… | …001110101011101000001011 |
3 | 111020201101100101102120212122 |
4 | 112332023213032223220023 |
5 | 101220234121112401443 |
6 | 554512330503201455 |
7 | 30165120030541334 |
oct | 2676134716535013 |
9 | 436641311376778 |
10 | 101030100122123 |
11 | 2a211696740357 |
12 | b3b838814628b |
13 | 444b136460b23 |
14 | 1ad3c50ac728b |
15 | ba305883a968 |
hex | 5be2e73aba0b |
101030100122123 has 8 divisors (see below), whose sum is σ = 104623809223536. Its totient is φ = 97498890309600.
The previous prime is 101030100122113. The next prime is 101030100122137. The reversal of 101030100122123 is 321221001030101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101030100122123 - 230 = 101029026380299 is a prime.
It is a super-2 number, since 2×1010301001221232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101030100122113) 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, 15624818933 + ... + 15624825398.
It is an arithmetic number, because the mean of its divisors is an integer number (13077976152942).
Almost surely, 2101030100122123 is an apocalyptic number.
101030100122123 is a deficient number, since it is larger than the sum of its proper divisors (3593709101413).
101030100122123 is an equidigital number, since it uses as much as digits as its factorization.
101030100122123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31249644445.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101030100122123 its reverse (321221001030101), we get a palindrome (422251101152224).
The spelling of 101030100122123 in words is "one hundred one trillion, thirty billion, one hundred million, one hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •