Base | Representation |
---|---|
bin | 1001010100000100001000… |
… | …0010111101000000111011 |
3 | 1100020222000211002101201011 |
4 | 2111001002002331000323 |
5 | 2320234123341312443 |
6 | 33440200012334351 |
7 | 2104560300463621 |
oct | 225010202750073 |
9 | 40228024071634 |
10 | 10240310104123 |
11 | 32989890a9060 |
12 | 11947831743b7 |
13 | 593870854ac8 |
14 | 2758c2a61511 |
15 | 12b592206b9d |
hex | 950420bd03b |
10240310104123 has 32 divisors (see below), whose sum is σ = 11501076081600. Its totient is φ = 9038218076160.
The previous prime is 10240310104111. The next prime is 10240310104153. The reversal of 10240310104123 is 32140101304201.
It is a cyclic number.
It is not a de Polignac number, because 10240310104123 - 225 = 10240276549691 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10240310104094 and 10240310104103.
It is not an unprimeable number, because it can be changed into a prime (10240310104103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 737927061 + ... + 737940937.
It is an arithmetic number, because the mean of its divisors is an integer number (359408627550).
Almost surely, 210240310104123 is an apocalyptic number.
10240310104123 is a deficient number, since it is larger than the sum of its proper divisors (1260765977477).
10240310104123 is a wasteful number, since it uses less digits than its factorization.
10240310104123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27087.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 10240310104123 its reverse (32140101304201), we get a palindrome (42380411408324).
The spelling of 10240310104123 in words is "ten trillion, two hundred forty billion, three hundred ten million, one hundred four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •