Base | Representation |
---|---|
bin | 11010101010010111… |
… | …00101111100000111 |
3 | 1100221120022202101212 |
4 | 31111023211330013 |
5 | 213303341113411 |
6 | 10324210442035 |
7 | 1014500012522 |
oct | 152513457407 |
9 | 40846282355 |
10 | 14314004231 |
11 | 608597826a |
12 | 293589331b |
13 | 14716a0cb7 |
14 | 99b093bb9 |
15 | 58b9ab68b |
hex | 3552e5f07 |
14314004231 has 4 divisors (see below), whose sum is σ = 14314629000. Its totient is φ = 14313379464.
The previous prime is 14314004213. The next prime is 14314004261. The reversal of 14314004231 is 13240041341.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14314004231 - 26 = 14314004167 is a prime.
It is a super-2 number, since 2×143140042312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14314004197 and 14314004206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14314004261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 276656 + ... + 324293.
It is an arithmetic number, because the mean of its divisors is an integer number (3578657250).
Almost surely, 214314004231 is an apocalyptic number.
14314004231 is a deficient number, since it is larger than the sum of its proper divisors (624769).
14314004231 is an equidigital number, since it uses as much as digits as its factorization.
14314004231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 624768.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 14314004231 its reverse (13240041341), we get a palindrome (27554045572).
The spelling of 14314004231 in words is "fourteen billion, three hundred fourteen million, four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •