Base | Representation |
---|---|
bin | 1001100101100001011000… |
… | …0011001101101001010100 |
3 | 1101022122011000212200100220 |
4 | 2121120112003031221110 |
5 | 2340142332214413320 |
6 | 34230035435434340 |
7 | 2135335320041103 |
oct | 231302603155124 |
9 | 41278130780326 |
10 | 10540219685460 |
11 | 33a409a258493 |
12 | 12229222b59b0 |
13 | 5b5c27a1603a |
14 | 286213b8803a |
15 | 1342969a4e40 |
hex | 996160cda54 |
10540219685460 has 48 divisors (see below), whose sum is σ = 29868188809536. Its totient is φ = 2776861088512.
The previous prime is 10540219685353. The next prime is 10540219685483. The reversal of 10540219685460 is 6458691204501.
It is a super-2 number, since 2×105402196854602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 1058250009 + ... + 1058259968.
It is an arithmetic number, because the mean of its divisors is an integer number (622253933532).
Almost surely, 210540219685460 is an apocalyptic number.
10540219685460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10540219685460 is an abundant number, since it is smaller than the sum of its proper divisors (19327969124076).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10540219685460 is a wasteful number, since it uses less digits than its factorization.
10540219685460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2116510072 (or 2116510070 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 51.
The spelling of 10540219685460 in words is "ten trillion, five hundred forty billion, two hundred nineteen million, six hundred eighty-five thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •