Base | Representation |
---|---|
bin | 11000010100000110… |
… | …00000100111000100 |
3 | 1020200201101121212212 |
4 | 30022003000213010 |
5 | 203213141303410 |
6 | 5555141002552 |
7 | 641322414245 |
oct | 141203004704 |
9 | 36621347785 |
10 | 13053462980 |
11 | 5599380a38 |
12 | 26436b3458 |
13 | 13004a03bc |
14 | 8bb8c4ccc |
15 | 515eb2b05 |
hex | 30a0c09c4 |
13053462980 has 24 divisors (see below), whose sum is σ = 27563728920. Its totient is φ = 5192536320.
The previous prime is 13053462979. The next prime is 13053462997. The reversal of 13053462980 is 8926435031.
It can be written as a sum of positive squares in 4 ways, for example, as 857476 + 13052605504 = 926^2 + 114248^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1799345 + ... + 1806584.
It is an arithmetic number, because the mean of its divisors is an integer number (1148488705).
Almost surely, 213053462980 is an apocalyptic number.
13053462980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13053462980 is an abundant number, since it is smaller than the sum of its proper divisors (14510265940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13053462980 is a wasteful number, since it uses less digits than its factorization.
13053462980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3606119 (or 3606117 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 13053462980 in words is "thirteen billion, fifty-three million, four hundred sixty-two thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •