Base | Representation |
---|---|
bin | 11001000101001011… |
… | …00001110111110100 |
3 | 1021202102002021021221 |
4 | 30202211201313310 |
5 | 210034040242200 |
6 | 10104045120124 |
7 | 654452005456 |
oct | 144245416764 |
9 | 37672067257 |
10 | 13465165300 |
11 | 578a809a94 |
12 | 2739559044 |
13 | 136787b342 |
14 | 91a4542d6 |
15 | 53c1d891a |
hex | 322961df4 |
13465165300 has 18 divisors (see below), whose sum is σ = 29219408918. Its totient is φ = 5386066080.
The previous prime is 13465165283. The next prime is 13465165303. The reversal of 13465165300 is 356156431.
13465165300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 581099236 + 12884066064 = 24106^2 + 113508^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13465165303) 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 5 ways as a sum of consecutive naturals, for example, 67325727 + ... + 67325926.
Almost surely, 213465165300 is an apocalyptic number.
13465165300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13465165300 is an abundant number, since it is smaller than the sum of its proper divisors (15754243618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13465165300 is a wasteful number, since it uses less digits than its factorization.
13465165300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134651667 (or 134651660 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 13465165300 in words is "thirteen billion, four hundred sixty-five million, one hundred sixty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •