Base | Representation |
---|---|
bin | 110000011011100001… |
… | …0001000100110110000 |
3 | 100221110010002111120111 |
4 | 1200313002020212300 |
5 | 3200444121142040 |
6 | 115440022551104 |
7 | 10341164563312 |
oct | 1406702104660 |
9 | 327403074514 |
10 | 104002521520 |
11 | 4011a791827 |
12 | 181a6298494 |
13 | 9a65b04a81 |
14 | 506886d7b2 |
15 | 2a8a80bdea |
hex | 18370889b0 |
104002521520 has 40 divisors (see below), whose sum is σ = 248341163184. Its totient is φ = 40476655872.
The previous prime is 104002521437. The next prime is 104002521521. The reversal of 104002521520 is 25125200401.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1040025215202 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104002521491 and 104002521500.
It is not an unprimeable number, because it can be changed into a prime (104002521521) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17565034 + ... + 17570953.
Almost surely, 2104002521520 is an apocalyptic number.
104002521520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104002521520 is an abundant number, since it is smaller than the sum of its proper divisors (144338641664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104002521520 is a wasteful number, since it uses less digits than its factorization.
104002521520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35136037 (or 35136031 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 22.
Adding to 104002521520 its reverse (25125200401), we get a palindrome (129127721921).
The spelling of 104002521520 in words is "one hundred four billion, two million, five hundred twenty-one thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •