Base | Representation |
---|---|
bin | 11001000111010011… |
… | …11100110100000000 |
3 | 1021210122211112001102 |
4 | 30203221330310000 |
5 | 210103133221230 |
6 | 10105525353532 |
7 | 655060320434 |
oct | 144351746400 |
9 | 37718745042 |
10 | 13483101440 |
11 | 579994a746 |
12 | 27435688a8 |
13 | 136b4bb243 |
14 | 91c9a29c4 |
15 | 53da7d045 |
hex | 323a7cd00 |
13483101440 has 72 divisors (see below), whose sum is σ = 32778483360. Its totient is φ = 5312710656.
The previous prime is 13483101433. The next prime is 13483101449. The reversal of 13483101440 is 4410138431.
13483101440 = T487 + T488 + ... + T4326.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13483101449) 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, 7151 + ... + 164369.
Almost surely, 213483101440 is an apocalyptic number.
13483101440 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 13483101440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16389241680).
13483101440 is an abundant number, since it is smaller than the sum of its proper divisors (19295381920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13483101440 is an equidigital number, since it uses as much as digits as its factorization.
13483101440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157307 (or 157293 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 13483101440 its reverse (4410138431), we get a palindrome (17893239871).
The spelling of 13483101440 in words is "thirteen billion, four hundred eighty-three million, one hundred one thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •