Base | Representation |
---|---|
bin | 1011110110001010010100… |
… | …0101011010101001110000 |
3 | 1201010012002100100012100002 |
4 | 2331202211011122221300 |
5 | 3201400411242031000 |
6 | 43411353025445132 |
7 | 2513014244345132 |
oct | 275424505325160 |
9 | 51105070305302 |
10 | 13025110502000 |
11 | 4171a11350593 |
12 | 156442b1a07a8 |
13 | 73635507161c |
14 | 3305c0d35052 |
15 | 178c2ddd58d5 |
hex | bd8a515aa70 |
13025110502000 has 80 divisors (see below), whose sum is σ = 32262881230944. Its totient is φ = 5082969920000.
The previous prime is 13025110501987. The next prime is 13025110502009. The reversal of 13025110502000 is 20501152031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13025110502009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79339406 + ... + 79503405.
Almost surely, 213025110502000 is an apocalyptic number.
13025110502000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13025110502000 is an abundant number, since it is smaller than the sum of its proper divisors (19237770728944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13025110502000 is a wasteful number, since it uses less digits than its factorization.
13025110502000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158842875 (or 158842859 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
Adding to 13025110502000 its reverse (20501152031), we get a palindrome (13045611654031).
The spelling of 13025110502000 in words is "thirteen trillion, twenty-five billion, one hundred ten million, five hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.952 sec. • engine limits •