Base | Representation |
---|---|
bin | 11000011111001111… |
… | …01100010010001010 |
3 | 1020221020100000201110 |
4 | 30033213230102022 |
5 | 203411110341010 |
6 | 10012321031150 |
7 | 643536234255 |
oct | 141747542212 |
9 | 36836300643 |
10 | 13146965130 |
11 | 5637134542 |
12 | 266aa854b6 |
13 | 131697a410 |
14 | 8ca0a409c |
15 | 51e2d2120 |
hex | 30f9ec48a |
13146965130 has 64 divisors (see below), whose sum is σ = 35978681088. Its totient is φ = 3045811200.
The previous prime is 13146965123. The next prime is 13146965173. The reversal of 13146965130 is 3156964131.
13146965130 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 (39).
It is a Curzon number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 984846 + ... + 998105.
It is an arithmetic number, because the mean of its divisors is an integer number (562166892).
Almost surely, 213146965130 is an apocalyptic number.
13146965130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13146965130 is an abundant number, since it is smaller than the sum of its proper divisors (22831715958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13146965130 is a wasteful number, since it uses less digits than its factorization.
13146965130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1982991.
The product of its (nonzero) digits is 58320, while the sum is 39.
Subtracting from 13146965130 its reverse (3156964131), we obtain a palindrome (9990000999).
The spelling of 13146965130 in words is "thirteen billion, one hundred forty-six million, nine hundred sixty-five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •