Base | Representation |
---|---|
bin | 1001010011011110001000… |
… | …1100010100101101000011 |
3 | 1100012222201002120200211002 |
4 | 2110313202030110231003 |
5 | 2320102232133404443 |
6 | 33431352032042215 |
7 | 2104046466235112 |
oct | 224674214245503 |
9 | 40188632520732 |
10 | 10230112013123 |
11 | 3294625595382 |
12 | 11927b799336b |
13 | 592906acb232 |
14 | 2751d6495c79 |
15 | 12b196c6a2b8 |
hex | 94de2314b43 |
10230112013123 has 4 divisors (see below), whose sum is σ = 10230263756880. Its totient is φ = 10229960269368.
The previous prime is 10230112013117. The next prime is 10230112013161. The reversal of 10230112013123 is 32131021103201.
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 10230112013123 - 218 = 10230111750979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10230112013095 and 10230112013104.
It is not an unprimeable number, because it can be changed into a prime (10230111013123) 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, 75770708 + ... + 75905601.
It is an arithmetic number, because the mean of its divisors is an integer number (2557565939220).
Almost surely, 210230112013123 is an apocalyptic number.
10230112013123 is a deficient number, since it is larger than the sum of its proper divisors (151743757).
10230112013123 is an equidigital number, since it uses as much as digits as its factorization.
10230112013123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151743756.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 10230112013123 its reverse (32131021103201), we get a palindrome (42361133116324).
The spelling of 10230112013123 in words is "ten trillion, two hundred thirty billion, one hundred twelve million, thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •