Base | Representation |
---|---|
bin | 11000010011010001… |
… | …11011110001011010 |
3 | 1020200020112100020220 |
4 | 30021220323301122 |
5 | 203204414034133 |
6 | 5554334300510 |
7 | 641210334426 |
oct | 141150736132 |
9 | 36606470226 |
10 | 13046627418 |
11 | 5595532310 |
12 | 2641357736 |
13 | 12cbc48ca6 |
14 | 8baa25b86 |
15 | 5155b25b3 |
hex | 309a3bc5a |
13046627418 has 64 divisors (see below), whose sum is σ = 28978038144. Its totient is φ = 3882528000.
The previous prime is 13046627383. The next prime is 13046627437. The reversal of 13046627418 is 81472664031.
13046627418 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 13046627418.
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, 2948848 + ... + 2953268.
It is an arithmetic number, because the mean of its divisors is an integer number (452781846).
Almost surely, 213046627418 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13046627418, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14489019072).
13046627418 is an abundant number, since it is smaller than the sum of its proper divisors (15931410726).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13046627418 is a wasteful number, since it uses less digits than its factorization.
13046627418 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5231.
The product of its (nonzero) digits is 193536, while the sum is 42.
The spelling of 13046627418 in words is "thirteen billion, forty-six million, six hundred twenty-seven thousand, four hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •