Base | Representation |
---|---|
bin | 11010101100101111… |
… | …11101010101110111 |
3 | 1100222221222211000220 |
4 | 31112113331111313 |
5 | 213324002214111 |
6 | 10330203505423 |
7 | 1015132120416 |
oct | 152627752567 |
9 | 40887884026 |
10 | 14334023031 |
11 | 6096200729 |
12 | 2940528273 |
13 | 147588cb43 |
14 | 99d9c547d |
15 | 58d612e06 |
hex | 3565fd577 |
14334023031 has 8 divisors (see below), whose sum is σ = 19212094464. Its totient is φ = 9505983480.
The previous prime is 14334023029. The next prime is 14334023051. The reversal of 14334023031 is 13032043341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14334023031 - 21 = 14334023029 is a prime.
It is a super-2 number, since 2×143340230312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14334022992 and 14334023010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14334023051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12507301 + ... + 12508446.
It is an arithmetic number, because the mean of its divisors is an integer number (2401511808).
Almost surely, 214334023031 is an apocalyptic number.
14334023031 is a deficient number, since it is larger than the sum of its proper divisors (4878071433).
14334023031 is a wasteful number, since it uses less digits than its factorization.
14334023031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25015941.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 14334023031 its reverse (13032043341), we get a palindrome (27366066372).
The spelling of 14334023031 in words is "fourteen billion, three hundred thirty-four million, twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •