Base | Representation |
---|---|
bin | 1001010100010000100011… |
… | …1000111101101110111100 |
3 | 1100021021122022110011112120 |
4 | 2111010020320331232330 |
5 | 2320312441403322422 |
6 | 33441511023402540 |
7 | 2105036046432606 |
oct | 225041070755674 |
9 | 40237568404476 |
10 | 10243646151612 |
11 | 329a3402239a5 |
12 | 1195354453450 |
13 | 593c82a488c3 |
14 | 275b1bb42176 |
15 | 12b6da02a45c |
hex | 95108e3dbbc |
10243646151612 has 24 divisors (see below), whose sum is σ = 23901940748112. Its totient is φ = 3414534470400.
The previous prime is 10243646151587. The next prime is 10243646151617. The reversal of 10243646151612 is 21615164634201.
10243646151612 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10243646151617) 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, 1449412 + ... + 4752692.
It is an arithmetic number, because the mean of its divisors is an integer number (995914197838).
Almost surely, 210243646151612 is an apocalyptic number.
10243646151612 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10243646151612 is an abundant number, since it is smaller than the sum of its proper divisors (13658294596500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10243646151612 is a wasteful number, since it uses less digits than its factorization.
10243646151612 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3561709 (or 3561707 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 42.
The spelling of 10243646151612 in words is "ten trillion, two hundred forty-three billion, six hundred forty-six million, one hundred fifty-one thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •