Base | Representation |
---|---|
bin | 1001010011101111000100… |
… | …0000100001011111011111 |
3 | 1100020102102202001001021000 |
4 | 2110323301000201133133 |
5 | 2320141033304422221 |
6 | 33433422535441343 |
7 | 2104300206514461 |
oct | 224736100413737 |
9 | 40212382031230 |
10 | 10234655545311 |
11 | 329654726935a |
12 | 1193665526253 |
13 | 59317c207212 |
14 | 275507a94131 |
15 | 12b360aa6e26 |
hex | 94ef10217df |
10234655545311 has 16 divisors (see below), whose sum is σ = 15651564037120. Its totient is φ = 6603003577080.
The previous prime is 10234655545237. The next prime is 10234655545339. The reversal of 10234655545311 is 11354555643201.
It is a happy number.
10234655545311 is a `hidden beast` number, since 1 + 0 + 2 + 3 + 4 + 65 + 5 + 54 + 531 + 1 = 666.
It is not a de Polignac number, because 10234655545311 - 211 = 10234655543263 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10234655545111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6113891365 + ... + 6113893038.
It is an arithmetic number, because the mean of its divisors is an integer number (978222752320).
Almost surely, 210234655545311 is an apocalyptic number.
10234655545311 is a deficient number, since it is larger than the sum of its proper divisors (5416908491809).
10234655545311 is a wasteful number, since it uses less digits than its factorization.
10234655545311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12227784443 (or 12227784437 counting only the distinct ones).
The product of its (nonzero) digits is 1080000, while the sum is 45.
The spelling of 10234655545311 in words is "ten trillion, two hundred thirty-four billion, six hundred fifty-five million, five hundred forty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •