Base | Representation |
---|---|
bin | 1001011001100001100110… |
… | …0011110001111001110111 |
3 | 1100120221011121012011120122 |
4 | 2112120121203301321313 |
5 | 2323303234222432043 |
6 | 33551232414522155 |
7 | 2114421062501123 |
oct | 226303143617167 |
9 | 40527147164518 |
10 | 10334120124023 |
11 | 3324748444523 |
12 | 11aa9a3b0635b |
13 | 59c670b0c117 |
14 | 27a26197c583 |
15 | 12dc32ccd368 |
hex | 966198f1e77 |
10334120124023 has 8 divisors (see below), whose sum is σ = 10359754464528. Its totient is φ = 10308493931904.
The previous prime is 10334120123909. The next prime is 10334120124047. The reversal of 10334120124023 is 32042102143301.
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 10334120124023 - 210 = 10334120122999 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10334120123983 and 10334120124001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10334120124323) 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, 506465 + ... + 4574357.
It is an arithmetic number, because the mean of its divisors is an integer number (1294969308066).
Almost surely, 210334120124023 is an apocalyptic number.
10334120124023 is a deficient number, since it is larger than the sum of its proper divisors (25634340505).
10334120124023 is an equidigital number, since it uses as much as digits as its factorization.
10334120124023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4074193.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 10334120124023 its reverse (32042102143301), we get a palindrome (42376222267324).
The spelling of 10334120124023 in words is "ten trillion, three hundred thirty-four billion, one hundred twenty million, one hundred twenty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •