Base | Representation |
---|---|
bin | 1001011011100000110001… |
… | …0001010100110100100110 |
3 | 1100201012021122121010101210 |
4 | 2112320030101110310212 |
5 | 2324333142232431440 |
6 | 34015040024532250 |
7 | 2120040033463152 |
oct | 226701421246446 |
9 | 40635248533353 |
10 | 10368256920870 |
11 | 3338175806222 |
12 | 11b5530321086 |
13 | 5a2951250cb4 |
14 | 27bb7d58a062 |
15 | 12ea7eb9ea80 |
hex | 96e0c454d26 |
10368256920870 has 32 divisors (see below), whose sum is σ = 24883901551872. Its totient is φ = 2764859074272.
The previous prime is 10368256920859. The next prime is 10368256920871. The reversal of 10368256920870 is 7802965286301.
It is a self number, because there is not a number n which added to its sum of digits gives 10368256920870.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10368256920871) 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 15 ways as a sum of consecutive naturals, for example, 15925359 + ... + 16563621.
It is an arithmetic number, because the mean of its divisors is an integer number (777621923496).
Almost surely, 210368256920870 is an apocalyptic number.
10368256920870 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10368256920870 is an abundant number, since it is smaller than the sum of its proper divisors (14515644631002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10368256920870 is a wasteful number, since it uses less digits than its factorization.
10368256920870 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1179756.
The product of its (nonzero) digits is 8709120, while the sum is 57.
The spelling of 10368256920870 in words is "ten trillion, three hundred sixty-eight billion, two hundred fifty-six million, nine hundred twenty thousand, eight hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •