Base | Representation |
---|---|
bin | 11000010100010100… |
… | …10011011011000000 |
3 | 1020200211222202201220 |
4 | 30022022103123000 |
5 | 203214134000130 |
6 | 5555245555040 |
7 | 641344566621 |
oct | 141212233300 |
9 | 36624882656 |
10 | 13055375040 |
11 | 559a467554 |
12 | 2644275a80 |
13 | 13009bc7b6 |
14 | 8bbc61a48 |
15 | 51623e410 |
hex | 30a2936c0 |
13055375040 has 112 divisors (see below), whose sum is σ = 41509602528. Its totient is φ = 3476496384.
The previous prime is 13055375017. The next prime is 13055375041. The reversal of 13055375040 is 4057355031.
It is a junction number, because it is equal to n+sod(n) for n = 13055374992 and 13055375010.
It is not an unprimeable number, because it can be changed into a prime (13055375041) 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 15 ways as a sum of consecutive naturals, for example, 694404 + ... + 712956.
Almost surely, 213055375040 is an apocalyptic number.
13055375040 is a gapful number since it is divisible by the number (10) 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 13055375040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20754801264).
13055375040 is an abundant number, since it is smaller than the sum of its proper divisors (28454227488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13055375040 is a wasteful number, since it uses less digits than its factorization.
13055375040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19306 (or 19296 counting only the distinct ones).
The product of its (nonzero) digits is 31500, while the sum is 33.
The spelling of 13055375040 in words is "thirteen billion, fifty-five million, three hundred seventy-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •