Base | Representation |
---|---|
bin | 11001010011000011… |
… | …01111010111010100 |
3 | 1022001112012101211012 |
4 | 30221201233113110 |
5 | 210303343100000 |
6 | 10123405031352 |
7 | 660364541621 |
oct | 145141572724 |
9 | 38045171735 |
10 | 13581612500 |
11 | 583a514545 |
12 | 2770555558 |
13 | 1385a30101 |
14 | 92bac7348 |
15 | 54753b735 |
hex | 32986f5d4 |
13581612500 has 36 divisors (see below), whose sum is σ = 29707903260. Its totient is φ = 5432640000.
The previous prime is 13581612497. The next prime is 13581612503. The reversal of 13581612500 is 521618531.
It is an interprime number because it is at equal distance from previous prime (13581612497) and next prime (13581612503).
It can be written as a sum of positive squares in 6 ways, for example, as 8863845904 + 4717766596 = 94148^2 + 68686^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13581612503) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 530765 + ... + 555764.
It is an arithmetic number, because the mean of its divisors is an integer number (825219535).
Almost surely, 213581612500 is an apocalyptic number.
13581612500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13581612500 is an abundant number, since it is smaller than the sum of its proper divisors (16126290760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13581612500 is an equidigital number, since it uses as much as digits as its factorization.
13581612500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1086558 (or 1086536 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 13581612500 in words is "thirteen billion, five hundred eighty-one million, six hundred twelve thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •