Base | Representation |
---|---|
bin | 1001011001111000101101… |
… | …0010110011000010001011 |
3 | 1100121112011220110012220110 |
4 | 2112132023102303002023 |
5 | 2323403440222221443 |
6 | 33554140125125403 |
7 | 2115030564231420 |
oct | 226361322630213 |
9 | 40545156405813 |
10 | 10340323242123 |
11 | 3327340997a06 |
12 | 11b00353b9863 |
13 | 5a011bcb44c4 |
14 | 27a68d741d47 |
15 | 12de97689233 |
hex | 9678b4b308b |
10340323242123 has 8 divisors (see below), whose sum is σ = 15756683035648. Its totient is φ = 5908756138344.
The previous prime is 10340323242097. The next prime is 10340323242127. The reversal of 10340323242123 is 32124232304301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10340323242123 - 28 = 10340323241867 is a prime.
It is a super-2 number, since 2×103403232421232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10340323242127) 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, 246198172411 + ... + 246198172452.
It is an arithmetic number, because the mean of its divisors is an integer number (1969585379456).
Almost surely, 210340323242123 is an apocalyptic number.
10340323242123 is a deficient number, since it is larger than the sum of its proper divisors (5416359793525).
10340323242123 is an equidigital number, since it uses as much as digits as its factorization.
10340323242123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492396344873.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 10340323242123 its reverse (32124232304301), we get a palindrome (42464555546424).
The spelling of 10340323242123 in words is "ten trillion, three hundred forty billion, three hundred twenty-three million, two hundred forty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •