Base | Representation |
---|---|
bin | 10101001001100010101… |
… | …111000010000000110101 |
3 | 12010221100211200002111211 |
4 | 111021202233002000311 |
5 | 142302432443122404 |
6 | 3031355015001421 |
7 | 210000334300135 |
oct | 25114257020065 |
9 | 5127324602454 |
10 | 1453355442229 |
11 | 510401292799 |
12 | 1b5805969271 |
13 | a708789b472 |
14 | 504b2828ac5 |
15 | 27c123a9b04 |
hex | 15262bc2035 |
1453355442229 has 8 divisors (see below), whose sum is σ = 1492668269568. Its totient is φ = 1414044349200.
The previous prime is 1453355442211. The next prime is 1453355442271. The reversal of 1453355442229 is 9222445533541.
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 1453355442229 - 25 = 1453355442197 is a prime.
It is a super-2 number, since 2×14533554422292 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1453355442289) 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 in 7 ways as a sum of consecutive naturals, for example, 1364604 + ... + 2183770.
It is an arithmetic number, because the mean of its divisors is an integer number (186583533696).
Almost surely, 21453355442229 is an apocalyptic number.
It is an amenable number.
1453355442229 is a deficient number, since it is larger than the sum of its proper divisors (39312827339).
1453355442229 is an equidigital number, since it uses as much as digits as its factorization.
1453355442229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 867155.
The product of its digits is 5184000, while the sum is 49.
The spelling of 1453355442229 in words is "one trillion, four hundred fifty-three billion, three hundred fifty-five million, four hundred forty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •