Base | Representation |
---|---|
bin | 11000011101011101… |
… | …00111001011100100 |
3 | 1020220012011211012012 |
4 | 30032232213023210 |
5 | 203343243031040 |
6 | 10011024213352 |
7 | 643265114114 |
oct | 141656471344 |
9 | 36805154165 |
10 | 13132002020 |
11 | 5629744535 |
12 | 2665a6a258 |
13 | 131383b7c7 |
14 | 8c80cb044 |
15 | 51cd28865 |
hex | 30eba72e4 |
13132002020 has 12 divisors (see below), whose sum is σ = 27577204284. Its totient is φ = 5252800800.
The previous prime is 13132001989. The next prime is 13132002029. The reversal of 13132002020 is 2020023131.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 4570571236 + 8561430784 = 67606^2 + 92528^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13132001986 and 13132002004.
It is not an unprimeable number, because it can be changed into a prime (13132002029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 328300031 + ... + 328300070.
It is an arithmetic number, because the mean of its divisors is an integer number (2298100357).
Almost surely, 213132002020 is an apocalyptic number.
13132002020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13132002020 is an abundant number, since it is smaller than the sum of its proper divisors (14445202264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13132002020 is a wasteful number, since it uses less digits than its factorization.
13132002020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 656600110 (or 656600108 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 13132002020 its reverse (2020023131), we get a palindrome (15152025151).
The spelling of 13132002020 in words is "thirteen billion, one hundred thirty-two million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •