Base | Representation |
---|---|
bin | 11001100111001000… |
… | …00110100100100000 |
3 | 1022111021001120112102 |
4 | 30303210012210200 |
5 | 211130000112000 |
6 | 10152222145532 |
7 | 664511051135 |
oct | 146344064440 |
9 | 38437046472 |
10 | 13750004000 |
11 | 5916578577 |
12 | 27b8a222a8 |
13 | 13b189b255 |
14 | 9461dc58c |
15 | 5572003d5 |
hex | 333906920 |
13750004000 has 48 divisors (see below), whose sum is σ = 33783769656. Its totient is φ = 5500000000.
The previous prime is 13750003933. The next prime is 13750004011. The reversal of 13750004000 is 40005731.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1046910736 + 12703093264 = 32356^2 + 112708^2 .
It is a super-2 number, since 2×137500040002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1714751 + ... + 1722750.
Almost surely, 213750004000 is an apocalyptic number.
13750004000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13750004000 is an abundant number, since it is smaller than the sum of its proper divisors (20033765656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13750004000 is an equidigital number, since it uses as much as digits as its factorization.
13750004000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3437526 (or 3437508 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 20.
Adding to 13750004000 its reverse (40005731), we get a palindrome (13790009731).
The spelling of 13750004000 in words is "thirteen billion, seven hundred fifty million, four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.807 sec. • engine limits •