Base | Representation |
---|---|
bin | 11001110001111010… |
… | …01110000111011110 |
3 | 1022201120021221212000 |
4 | 30320331032013132 |
5 | 211321130141330 |
6 | 10205213223130 |
7 | 666660043605 |
oct | 147075160736 |
9 | 38646257760 |
10 | 13840474590 |
11 | 5962650458 |
12 | 2823191aa6 |
13 | 13c7556447 |
14 | 95422ca3c |
15 | 560121560 |
hex | 338f4e1de |
13840474590 has 128 divisors (see below), whose sum is σ = 37719665280. Its totient is φ = 3610054656.
The previous prime is 13840474561. The next prime is 13840474607. The reversal of 13840474590 is 9547404831.
13840474590 is a `hidden beast` number, since 13 + 8 + 4 + 0 + 47 + 4 + 590 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5336334 + ... + 5338926.
It is an arithmetic number, because the mean of its divisors is an integer number (294684885).
Almost surely, 213840474590 is an apocalyptic number.
13840474590 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13840474590, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18859832640).
13840474590 is an abundant number, since it is smaller than the sum of its proper divisors (23879190690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13840474590 is a wasteful number, since it uses less digits than its factorization.
13840474590 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3035 (or 3029 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 13840474590 in words is "thirteen billion, eight hundred forty million, four hundred seventy-four thousand, five hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •