Base | Representation |
---|---|
bin | 11000011111001001… |
… | …10100010100011110 |
3 | 1020221011220202002110 |
4 | 30033210310110132 |
5 | 203410412232424 |
6 | 10012252534450 |
7 | 643526645364 |
oct | 141744642436 |
9 | 36834822073 |
10 | 13146211614 |
11 | 563676a3a8 |
12 | 266a781426 |
13 | 1316775453 |
14 | 8c9d49634 |
15 | 51e1d3c29 |
hex | 30f93451e |
13146211614 has 64 divisors (see below), whose sum is σ = 28158451200. Its totient is φ = 4082424192.
The previous prime is 13146211609. The next prime is 13146211619. The reversal of 13146211614 is 41611264131.
13146211614 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13146211609) and next prime (13146211619).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13146211619) 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 31 ways as a sum of consecutive naturals, for example, 880072 + ... + 894884.
It is an arithmetic number, because the mean of its divisors is an integer number (439975800).
Almost surely, 213146211614 is an apocalyptic number.
13146211614 is an abundant number, since it is smaller than the sum of its proper divisors (15012239586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13146211614 is a wasteful number, since it uses less digits than its factorization.
13146211614 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15009.
The product of its digits is 3456, while the sum is 30.
Adding to 13146211614 its reverse (41611264131), we get a palindrome (54757475745).
The spelling of 13146211614 in words is "thirteen billion, one hundred forty-six million, two hundred eleven thousand, six hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •