Base | Representation |
---|---|
bin | 11001000101100000… |
… | …11000111110010111 |
3 | 1021202121102220211112 |
4 | 30202300120332113 |
5 | 210040302344224 |
6 | 10104230125235 |
7 | 654515134250 |
oct | 144260307627 |
9 | 37677386745 |
10 | 13468012439 |
11 | 57913840a2 |
12 | 273a4b081b |
13 | 136833723b |
14 | 91a995b27 |
15 | 53c59c30e |
hex | 322c18f97 |
13468012439 has 8 divisors (see below), whose sum is σ = 15417715200. Its totient is φ = 11524734936.
The previous prime is 13468012417. The next prime is 13468012451. The reversal of 13468012439 is 93421086431.
13468012439 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 cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13468012439 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13468012396 and 13468012405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13468012489) 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 7 ways as a sum of consecutive naturals, for example, 1601819 + ... + 1610204.
It is an arithmetic number, because the mean of its divisors is an integer number (1927214400).
Almost surely, 213468012439 is an apocalyptic number.
13468012439 is a deficient number, since it is larger than the sum of its proper divisors (1949702761).
13468012439 is an equidigital number, since it uses as much as digits as its factorization.
13468012439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3212629.
The product of its (nonzero) digits is 124416, while the sum is 41.
The spelling of 13468012439 in words is "thirteen billion, four hundred sixty-eight million, twelve thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •