Base | Representation |
---|---|
bin | 11001001111011011… |
… | …11011011000001000 |
3 | 1021222102001222102021 |
4 | 30213231323120020 |
5 | 210223110044000 |
6 | 10120402214224 |
7 | 656545515145 |
oct | 144755733010 |
9 | 37872058367 |
10 | 13551253000 |
11 | 5824368a4a |
12 | 2762354374 |
13 | 137c6605cc |
14 | 927a633cc |
15 | 544a4111a |
hex | 327b7b608 |
13551253000 has 64 divisors (see below), whose sum is σ = 31768167600. Its totient is φ = 5410547200.
The previous prime is 13551252991. The next prime is 13551253013. The reversal of 13551253000 is 35215531.
It can be written as a sum of positive squares in 8 ways, for example, as 145781476 + 13405471524 = 12074^2 + 115782^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 544836 + ... + 569164.
Almost surely, 213551253000 is an apocalyptic number.
13551253000 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 13551253000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15884083800).
13551253000 is an abundant number, since it is smaller than the sum of its proper divisors (18216914600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13551253000 is a wasteful number, since it uses less digits than its factorization.
13551253000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24907 (or 24893 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 25.
Adding to 13551253000 its reverse (35215531), we get a palindrome (13586468531).
The spelling of 13551253000 in words is "thirteen billion, five hundred fifty-one million, two hundred fifty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •