Base | Representation |
---|---|
bin | 11001000111000011… |
… | …10101110000001000 |
3 | 1021210111211111122000 |
4 | 30203201311300020 |
5 | 210102112202433 |
6 | 10105412031000 |
7 | 655033254120 |
oct | 144341656010 |
9 | 37714744560 |
10 | 13480975368 |
11 | 5798728363 |
12 | 2742902460 |
13 | 136ac25603 |
14 | 91c5abc80 |
15 | 53d7ad113 |
hex | 323875c08 |
13480975368 has 256 divisors, whose sum is σ = 43670016000. Its totient is φ = 3773993472.
The previous prime is 13480975297. The next prime is 13480975373. The reversal of 13480975368 is 86357908431.
13480975368 is a `hidden beast` number, since 13 + 4 + 8 + 0 + 97 + 536 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
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, 16663348 + ... + 16664156.
It is an arithmetic number, because the mean of its divisors is an integer number (170586000).
Almost surely, 213480975368 is an apocalyptic number.
13480975368 is a gapful number since it is divisible by the number (18) 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 13480975368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21835008000).
13480975368 is an abundant number, since it is smaller than the sum of its proper divisors (30189040632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13480975368 is a wasteful number, since it uses less digits than its factorization.
13480975368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1041 (or 1031 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 54.
The spelling of 13480975368 in words is "thirteen billion, four hundred eighty million, nine hundred seventy-five thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •