Base | Representation |
---|---|
bin | 100111110001001… |
… | …1111001000000101 |
3 | 10102222222121011111 |
4 | 1033202133020011 |
5 | 10213104043303 |
6 | 340225405021 |
7 | 45032361643 |
oct | 11742371005 |
9 | 3388877144 |
10 | 1334440453 |
11 | 625290955 |
12 | 312a99771 |
13 | 183606148 |
14 | c9328193 |
15 | 7c244b6d |
hex | 4f89f205 |
1334440453 has 8 divisors (see below), whose sum is σ = 1357032440. Its totient is φ = 1311871680.
The previous prime is 1334440441. The next prime is 1334440493. The reversal of 1334440453 is 3540444331.
It can be written as a sum of positive squares in 4 ways, for example, as 88491649 + 1245948804 = 9407^2 + 35298^2 .
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 1334440453 - 213 = 1334432261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1334440493) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 141151 + ... + 150307.
It is an arithmetic number, because the mean of its divisors is an integer number (169629055).
Almost surely, 21334440453 is an apocalyptic number.
It is an amenable number.
1334440453 is a deficient number, since it is larger than the sum of its proper divisors (22591987).
1334440453 is an equidigital number, since it uses as much as digits as its factorization.
1334440453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11607.
The product of its (nonzero) digits is 34560, while the sum is 31.
The square root of 1334440453 is about 36529.9938817405. The cubic root of 1334440453 is about 1100.9469677363.
Adding to 1334440453 its reverse (3540444331), we get a palindrome (4874884784).
The spelling of 1334440453 in words is "one billion, three hundred thirty-four million, four hundred forty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.011 sec. • engine limits •