Base | Representation |
---|---|
bin | 11010000100101010… |
… | …11101111101000000 |
3 | 1100010112101020012200 |
4 | 31002111131331000 |
5 | 212131420411411 |
6 | 10232553553200 |
7 | 1003610361630 |
oct | 150225357500 |
9 | 40115336180 |
10 | 13997825856 |
11 | 5a33453823 |
12 | 2867a15800 |
13 | 142102a3c1 |
14 | 96b0ac6c0 |
15 | 56dd53e56 |
hex | 34255df40 |
13997825856 has 168 divisors, whose sum is σ = 45909000384. Its totient is φ = 3994583040.
The previous prime is 13997825773. The next prime is 13997825917. The reversal of 13997825856 is 65852879931.
It is a tau number, because it is divible by the number of its divisors (168).
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 13997825793 and 13997825802.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4647391 + ... + 4650401.
Almost surely, 213997825856 is an apocalyptic number.
13997825856 is a gapful number since it is divisible by the number (16) 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 13997825856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22954500192).
13997825856 is an abundant number, since it is smaller than the sum of its proper divisors (31911174528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13997825856 is a wasteful number, since it uses less digits than its factorization.
13997825856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4189 (or 4176 counting only the distinct ones).
The product of its digits is 32659200, while the sum is 63.
The spelling of 13997825856 in words is "thirteen billion, nine hundred ninety-seven million, eight hundred twenty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •