Base | Representation |
---|---|
bin | 11010101000101100… |
… | …10101110000101011 |
3 | 1100220121001112000112 |
4 | 31110112111300223 |
5 | 213241302404311 |
6 | 10322551324535 |
7 | 1014240241226 |
oct | 152426256053 |
9 | 40817045015 |
10 | 14300044331 |
11 | 6079002a61 |
12 | 293108074b |
13 | 146b823bc1 |
14 | 99929c5bd |
15 | 58a65028b |
hex | 354595c2b |
14300044331 has 2 divisors, whose sum is σ = 14300044332. Its totient is φ = 14300044330.
The previous prime is 14300044327. The next prime is 14300044337. The reversal of 14300044331 is 13344000341.
14300044331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14300044331 - 22 = 14300044327 is a prime.
It is a super-2 number, since 2×143000443312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14300044297 and 14300044306.
It is not a weakly prime, because it can be changed into another prime (14300044337) 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 as a sum of consecutive naturals, namely, 7150022165 + 7150022166.
It is an arithmetic number, because the mean of its divisors is an integer number (7150022166).
Almost surely, 214300044331 is an apocalyptic number.
14300044331 is a deficient number, since it is larger than the sum of its proper divisors (1).
14300044331 is an equidigital number, since it uses as much as digits as its factorization.
14300044331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 14300044331 its reverse (13344000341), we get a palindrome (27644044672).
The spelling of 14300044331 in words is "fourteen billion, three hundred million, forty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •