Base | Representation |
---|---|
bin | 10111111100100100001100… |
… | …101000100001010011110000 |
3 | 111210220012212010110102111001 |
4 | 113330210030220201103300 |
5 | 102301003412340422000 |
6 | 1011554002104131344 |
7 | 31116624020065405 |
oct | 2774441450412360 |
9 | 453805763412431 |
10 | 105317105014000 |
11 | 30614808195140 |
12 | b98b1b1466b54 |
13 | 469c48ba09c69 |
14 | 1c015373142ac |
15 | c298161bc46a |
hex | 5fc90ca214f0 |
105317105014000 has 160 divisors (see below), whose sum is σ = 280557948445632. Its totient is φ = 37917948800000.
The previous prime is 105317105013919. The next prime is 105317105014013. The reversal of 105317105014000 is 410501713501.
It is a super-2 number, since 2×1053171050140002 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105317105014000.
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, 21476719 + ... + 25920718.
Almost surely, 2105317105014000 is an apocalyptic number.
105317105014000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105317105014000 is an abundant number, since it is smaller than the sum of its proper divisors (175240843431632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105317105014000 is a wasteful number, since it uses less digits than its factorization.
105317105014000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47397572 (or 47397556 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 28.
Adding to 105317105014000 its reverse (410501713501), we get a palindrome (105727606727501).
The spelling of 105317105014000 in words is "one hundred five trillion, three hundred seventeen billion, one hundred five million, fourteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •