Base | Representation |
---|---|
bin | 1001011001111100000100… |
… | …1110000100000000000000 |
3 | 1100121121111221212012000002 |
4 | 2112133001032010000000 |
5 | 2323412313330024220 |
6 | 33554410004415132 |
7 | 2115062161262564 |
oct | 226370116040000 |
9 | 40547457765002 |
10 | 10341227970560 |
11 | 3327765659863 |
12 | 11b02483a74a8 |
13 | 5a0234575186 |
14 | 27a73796d6a4 |
15 | 12deebcebc75 |
hex | 967c1384000 |
10341227970560 has 240 divisors, whose sum is σ = 26446018690224. Its totient is φ = 3868289138688.
The previous prime is 10341227970547. The next prime is 10341227970659. The reversal of 10341227970560 is 6507972214301.
It can be written as a sum of positive squares in 8 ways, for example, as 189510467584 + 10151717502976 = 435328^2 + 3186176^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 218620832 + ... + 218668128.
Almost surely, 210341227970560 is an apocalyptic number.
10341227970560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10341227970560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13223009345112).
10341227970560 is an abundant number, since it is smaller than the sum of its proper divisors (16104790719664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10341227970560 is an equidigital number, since it uses as much as digits as its factorization.
10341227970560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47504 (or 47478 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 47.
The spelling of 10341227970560 in words is "ten trillion, three hundred forty-one billion, two hundred twenty-seven million, nine hundred seventy thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •