Base | Representation |
---|---|
bin | 11000010100011100… |
… | …11001111000110110 |
3 | 1020200221000101110000 |
4 | 30022032121320312 |
5 | 203214422400402 |
6 | 5555325012130 |
7 | 641356665123 |
oct | 141216317066 |
9 | 36627011400 |
10 | 13056450102 |
11 | 55a0031233 |
12 | 26446b4046 |
13 | 1300ca7c27 |
14 | 8bc06174a |
15 | 5163a2c1c |
hex | 30a399e36 |
13056450102 has 20 divisors (see below), whose sum is σ = 29256120036. Its totient is φ = 4352149980.
The previous prime is 13056450061. The next prime is 13056450103. The reversal of 13056450102 is 20105465031.
13056450102 is a `hidden beast` number, since 1 + 3 + 0 + 5 + 645 + 0 + 10 + 2 = 666.
13056450102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13056450103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 40297524 + ... + 40297847.
Almost surely, 213056450102 is an apocalyptic number.
13056450102 is an abundant number, since it is smaller than the sum of its proper divisors (16199669934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13056450102 is an equidigital number, since it uses as much as digits as its factorization.
13056450102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80595385 (or 80595376 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 13056450102 in words is "thirteen billion, fifty-six million, four hundred fifty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •