Base | Representation |
---|---|
bin | 11011110001100000… |
… | …10010011110011001 |
3 | 1102111011100110111101 |
4 | 31320300102132121 |
5 | 221014132421033 |
6 | 10503330431401 |
7 | 1035334635031 |
oct | 157060223631 |
9 | 42434313441 |
10 | 14910826393 |
11 | 6361855621 |
12 | 2a81732561 |
13 | 15382262c8 |
14 | a164508c1 |
15 | 5c409c97d |
hex | 378c12799 |
14910826393 has 4 divisors (see below), whose sum is σ = 14932658448. Its totient is φ = 14888994340.
The previous prime is 14910826339. The next prime is 14910826471. The reversal of 14910826393 is 39362801941.
It is a happy number.
14910826393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14910826393 - 217 = 14910695321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14910826993) 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, 10915003 + ... + 10916368.
It is an arithmetic number, because the mean of its divisors is an integer number (3733164612).
Almost surely, 214910826393 is an apocalyptic number.
It is an amenable number.
14910826393 is a deficient number, since it is larger than the sum of its proper divisors (21832055).
14910826393 is an equidigital number, since it uses as much as digits as its factorization.
14910826393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21832054.
The product of its (nonzero) digits is 279936, while the sum is 46.
The spelling of 14910826393 in words is "fourteen billion, nine hundred ten million, eight hundred twenty-six thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •