Base | Representation |
---|---|
bin | 11001011000101001… |
… | …00100100101111000 |
3 | 1022011210102010121121 |
4 | 30230110210211320 |
5 | 210402343222102 |
6 | 10132201515024 |
7 | 661504162162 |
oct | 145424444570 |
9 | 38153363547 |
10 | 13628492152 |
11 | 5863a23960 |
12 | 27841a2a74 |
13 | 1392665152 |
14 | 93400b932 |
15 | 54b6ebb37 |
hex | 32c524978 |
13628492152 has 32 divisors (see below), whose sum is σ = 27952485120. Its totient is φ = 6177875040.
The previous prime is 13628492131. The next prime is 13628492167. The reversal of 13628492152 is 25129482631.
It is a super-2 number, since 2×136284921522 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13628492099 and 13628492108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 178698 + ... + 243289.
It is an arithmetic number, because the mean of its divisors is an integer number (873515160).
Almost surely, 213628492152 is an apocalyptic number.
It is an amenable number.
13628492152 is an abundant number, since it is smaller than the sum of its proper divisors (14323992968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13628492152 is a wasteful number, since it uses less digits than its factorization.
13628492152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422371 (or 422367 counting only the distinct ones).
The product of its digits is 207360, while the sum is 43.
The spelling of 13628492152 in words is "thirteen billion, six hundred twenty-eight million, four hundred ninety-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •