Base | Representation |
---|---|
bin | 11000110001100011… |
… | …10110010011000100 |
3 | 1021022221110122001100 |
4 | 30120301312103010 |
5 | 204214424410112 |
6 | 10035450300100 |
7 | 650413266111 |
oct | 143061662304 |
9 | 37287418040 |
10 | 13300622532 |
11 | 570594462a |
12 | 26b2427630 |
13 | 133c759c62 |
14 | 902661908 |
15 | 52ca352dc |
hex | 318c764c4 |
13300622532 has 72 divisors (see below), whose sum is σ = 34203019032. Its totient is φ = 4357440000.
The previous prime is 13300622521. The next prime is 13300622539. The reversal of 13300622532 is 23522600331.
13300622532 is a `hidden beast` number, since 1 + 3 + 3 + 0 + 0 + 622 + 5 + 32 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 2744292996 + 10556329536 = 52386^2 + 102744^2 .
It is a junction number, because it is equal to n+sod(n) for n = 13300622496 and 13300622505.
It is not an unprimeable number, because it can be changed into a prime (13300622539) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 484782 + ... + 511482.
It is an arithmetic number, because the mean of its divisors is an integer number (475041931).
Almost surely, 213300622532 is an apocalyptic number.
13300622532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13300622532 is an abundant number, since it is smaller than the sum of its proper divisors (20902396500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13300622532 is a wasteful number, since it uses less digits than its factorization.
13300622532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26949 (or 26944 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
The spelling of 13300622532 in words is "thirteen billion, three hundred million, six hundred twenty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •