Base | Representation |
---|---|
bin | 1001010011101101110111… |
… | …1011011011110101111111 |
3 | 1100020101121102201020021220 |
4 | 2110323131323123311333 |
5 | 2320134404333204401 |
6 | 33433331102524423 |
7 | 2104256241635514 |
oct | 224733573336577 |
9 | 40211542636256 |
10 | 10234335444351 |
11 | 32963a2605807 |
12 | 1193596296713 |
13 | 59312aabc075 |
14 | 2754b736b30b |
15 | 12b342927336 |
hex | 94eddedbd7f |
10234335444351 has 16 divisors (see below), whose sum is σ = 13898437109760. Its totient is φ = 6697029057120.
The previous prime is 10234335444343. The next prime is 10234335444353. The reversal of 10234335444351 is 15344453343201.
It is not a de Polignac number, because 10234335444351 - 23 = 10234335444343 is a prime.
It is a super-2 number, since 2×102343354443512 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10234335444353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58289515 + ... + 58464828.
It is an arithmetic number, because the mean of its divisors is an integer number (868652319360).
Almost surely, 210234335444351 is an apocalyptic number.
10234335444351 is a deficient number, since it is larger than the sum of its proper divisors (3664101665409).
10234335444351 is a wasteful number, since it uses less digits than its factorization.
10234335444351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116754886.
The product of its (nonzero) digits is 1036800, while the sum is 42.
Adding to 10234335444351 its reverse (15344453343201), we get a palindrome (25578788787552).
The spelling of 10234335444351 in words is "ten trillion, two hundred thirty-four billion, three hundred thirty-five million, four hundred forty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •