Base | Representation |
---|---|
bin | 11001101101010111… |
… | …00101111010110000 |
3 | 1022121220110102212100 |
4 | 30312223211322300 |
5 | 211231342032211 |
6 | 10201331100400 |
7 | 666014414640 |
oct | 146653457260 |
9 | 38556412770 |
10 | 13802299056 |
11 | 5943046627 |
12 | 2812441700 |
13 | 13bc67b180 |
14 | 94d132520 |
15 | 55bad0156 |
hex | 336ae5eb0 |
13802299056 has 240 divisors, whose sum is σ = 47643575616. Its totient is φ = 3632338944.
The previous prime is 13802299051. The next prime is 13802299087. The reversal of 13802299056 is 65099220831.
It is a super-2 number, since 2×138022990562 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13802299051) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 8556106 + ... + 8557718.
Almost surely, 213802299056 is an apocalyptic number.
13802299056 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 13802299056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23821787808).
13802299056 is an abundant number, since it is smaller than the sum of its proper divisors (33841276560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13802299056 is a wasteful number, since it uses less digits than its factorization.
13802299056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2300 (or 2291 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The spelling of 13802299056 in words is "thirteen billion, eight hundred two million, two hundred ninety-nine thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •