Base | Representation |
---|---|
bin | 1001101011100010101011… |
… | …0100000010110000110100 |
3 | 1101200112010002002002212201 |
4 | 2122320222310002300310 |
5 | 2343341142143322424 |
6 | 34345342443154244 |
7 | 2145656333560450 |
oct | 232705264026064 |
9 | 41615102062781 |
10 | 10643647245364 |
11 | 3433a44433021 |
12 | 123a987b15984 |
13 | 5c28cb67aa23 |
14 | 28b22610b660 |
15 | 136ceba8cd44 |
hex | 9ae2ad02c34 |
10643647245364 has 24 divisors (see below), whose sum is σ = 21291036643520. Its totient is φ = 4560761215296.
The previous prime is 10643647245353. The next prime is 10643647245367. The reversal of 10643647245364 is 46354274634601.
It is a super-2 number, since 2×106436472453642 (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 (10643647245367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33249942 + ... + 33568525.
Almost surely, 210643647245364 is an apocalyptic number.
10643647245364 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10643647245364 is an abundant number, since it is smaller than the sum of its proper divisors (10647389398156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10643647245364 is a wasteful number, since it uses less digits than its factorization.
10643647245364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66824167 (or 66824165 counting only the distinct ones).
The product of its (nonzero) digits is 34836480, while the sum is 55.
The spelling of 10643647245364 in words is "ten trillion, six hundred forty-three billion, six hundred forty-seven million, two hundred forty-five thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •