Base | Representation |
---|---|
bin | 1001111111001100111010… |
… | …0001010000000000000000 |
3 | 1102212210220201210100010110 |
4 | 2133303032201100000000 |
5 | 2414404402203400420 |
6 | 35204441443231320 |
7 | 2212244234231130 |
oct | 237631641200000 |
9 | 42783821710113 |
10 | 10981401231360 |
11 | 355420578a83a |
12 | 1294329078540 |
13 | 618707139501 |
14 | 29d707402ac0 |
15 | 1409b8977ee0 |
hex | 9fcce850000 |
10981401231360 has 544 divisors, whose sum is σ = 40309302712320. Its totient is φ = 2500721639424.
The previous prime is 10981401231331. The next prime is 10981401231487. The reversal of 10981401231360 is 6313210418901.
It is a super-2 number, since 2×109814012313602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1947399421 + ... + 1947405059.
Almost surely, 210981401231360 is an apocalyptic number.
10981401231360 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 10981401231360, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20154651356160).
10981401231360 is an abundant number, since it is smaller than the sum of its proper divisors (29327901480960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10981401231360 is an frugal number, since it uses more digits than its factorization.
10981401231360 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5969 (or 5939 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 39.
The spelling of 10981401231360 in words is "ten trillion, nine hundred eighty-one billion, four hundred one million, two hundred thirty-one thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •