Base | Representation |
---|---|
bin | 11000001101101110… |
… | …00100001110011110 |
3 | 1020112222210110000211 |
4 | 30012313010032132 |
5 | 203111000003124 |
6 | 5545551043034 |
7 | 640103115562 |
oct | 140667041636 |
9 | 36488713024 |
10 | 13000000414 |
11 | 55711857a5 |
12 | 262981047a |
13 | 12c23a1c4b |
14 | 8b47696a2 |
15 | 511451e94 |
hex | 306dc439e |
13000000414 has 8 divisors (see below), whose sum is σ = 19517943168. Its totient is φ = 6494019360.
The previous prime is 13000000411. The next prime is 13000000427. The reversal of 13000000414 is 41400000031.
13000000414 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×130000004143 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13000000394 and 13000000403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13000000411) 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 3 ways as a sum of consecutive naturals, for example, 2987707 + ... + 2992054.
It is an arithmetic number, because the mean of its divisors is an integer number (2439742896).
Almost surely, 213000000414 is an apocalyptic number.
13000000414 is a deficient number, since it is larger than the sum of its proper divisors (6517942754).
13000000414 is a wasteful number, since it uses less digits than its factorization.
13000000414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5980850.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 13000000414 its reverse (41400000031), we get a palindrome (54400000445).
The spelling of 13000000414 in words is "thirteen billion, four hundred fourteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •