Base | Representation |
---|---|
bin | 100111110000100… |
… | …1111011011100111 |
3 | 10102222101000101111 |
4 | 1033201033123213 |
5 | 10213013122043 |
6 | 340214405451 |
7 | 45026532154 |
oct | 11741173347 |
9 | 3388330344 |
10 | 1334114023 |
11 | 625088680 |
12 | 312960887 |
13 | 1835206a8 |
14 | c928122b |
15 | 7c1cd09d |
hex | 4f84f6e7 |
1334114023 has 8 divisors (see below), whose sum is σ = 1459595520. Its totient is φ = 1209332280.
The previous prime is 1334114003. The next prime is 1334114059. The reversal of 1334114023 is 3204114331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1334114023 - 29 = 1334113511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1334113985 and 1334114003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1334114003) 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 7 ways as a sum of consecutive naturals, for example, 170943 + ... + 178576.
It is an arithmetic number, because the mean of its divisors is an integer number (182449440).
Almost surely, 21334114023 is an apocalyptic number.
1334114023 is a deficient number, since it is larger than the sum of its proper divisors (125481497).
1334114023 is a wasteful number, since it uses less digits than its factorization.
1334114023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349877.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 1334114023 is about 36525.5256361904. The cubic root of 1334114023 is about 1100.8571894261.
Adding to 1334114023 its reverse (3204114331), we get a palindrome (4538228354).
The spelling of 1334114023 in words is "one billion, three hundred thirty-four million, one hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •