Base | Representation |
---|---|
bin | 1001001100101101101101… |
… | …0011110100110011101011 |
3 | 1022210220002022100111102222 |
4 | 2103023123103310303223 |
5 | 2311202014300001443 |
6 | 33302153343344255 |
7 | 2062500103055420 |
oct | 223133323646353 |
9 | 38726068314388 |
10 | 10114032422123 |
11 | 324a3786a25a3 |
12 | 1174200bb208b |
13 | 584997bb9406 |
14 | 26d743aa5d47 |
15 | 128151067468 |
hex | 932db4f4ceb |
10114032422123 has 4 divisors (see below), whose sum is σ = 11558894196720. Its totient is φ = 8669170647528.
The previous prime is 10114032422083. The next prime is 10114032422189. The reversal of 10114032422123 is 32122423041101.
It is a happy number.
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 10114032422123 - 214 = 10114032405739 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10114032422092 and 10114032422101.
It is not an unprimeable number, because it can be changed into a prime (10114037422123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 722430887288 + ... + 722430887301.
It is an arithmetic number, because the mean of its divisors is an integer number (2889723549180).
Almost surely, 210114032422123 is an apocalyptic number.
10114032422123 is a deficient number, since it is larger than the sum of its proper divisors (1444861774597).
10114032422123 is an equidigital number, since it uses as much as digits as its factorization.
10114032422123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1444861774596.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 10114032422123 its reverse (32122423041101), we get a palindrome (42236455463224).
The spelling of 10114032422123 in words is "ten trillion, one hundred fourteen billion, thirty-two million, four hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •