Base | Representation |
---|---|
bin | 11000011101100001… |
… | …00110000000110010 |
3 | 1020220020011012211000 |
4 | 30032300212000302 |
5 | 203343411142042 |
6 | 10011043302430 |
7 | 643302406521 |
oct | 141660460062 |
9 | 36806135730 |
10 | 13132521522 |
11 | 5629a6987a |
12 | 266607aa16 |
13 | 13139910c3 |
14 | 8c81c44b8 |
15 | 51cdcc74c |
hex | 30ec26032 |
13132521522 has 64 divisors (see below), whose sum is σ = 31189069440. Its totient is φ = 4081471488.
The previous prime is 13132521509. The next prime is 13132521551. The reversal of 13132521522 is 22512523131.
13132521522 is a `hidden beast` number, since 1 + 3 + 132 + 5 + 2 + 1 + 522 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31378 + ... + 165074.
It is an arithmetic number, because the mean of its divisors is an integer number (487329210).
Almost surely, 213132521522 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13132521522, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15594534720).
13132521522 is an abundant number, since it is smaller than the sum of its proper divisors (18056547918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13132521522 is a wasteful number, since it uses less digits than its factorization.
13132521522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133832 (or 133826 counting only the distinct ones).
The product of its digits is 3600, while the sum is 27.
The spelling of 13132521522 in words is "thirteen billion, one hundred thirty-two million, five hundred twenty-one thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •