Base | Representation |
---|---|
bin | 11001110010000011… |
… | …11000001100010000 |
3 | 1022201122120222122001 |
4 | 30321001320030100 |
5 | 211321433224004 |
6 | 10205255323344 |
7 | 1000003320250 |
oct | 147101701420 |
9 | 38648528561 |
10 | 13841695504 |
11 | 596330477a |
12 | 2823680554 |
13 | 13c7893090 |
14 | 954469960 |
15 | 5602b31a4 |
hex | 339078310 |
13841695504 has 120 divisors (see below), whose sum is σ = 34506527552. Its totient is φ = 5237464320.
The previous prime is 13841695499. The next prime is 13841695507. The reversal of 13841695504 is 40559614831.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is not an unprimeable number, because it can be changed into a prime (13841695507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 761239 + ... + 779209.
Almost surely, 213841695504 is an apocalyptic number.
13841695504 is a gapful number since it is divisible by the number (14) 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 13841695504, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17253263776).
13841695504 is an abundant number, since it is smaller than the sum of its proper divisors (20664832048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13841695504 is a wasteful number, since it uses less digits than its factorization.
13841695504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18045 (or 18016 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 46.
The spelling of 13841695504 in words is "thirteen billion, eight hundred forty-one million, six hundred ninety-five thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •