Base | Representation |
---|---|
bin | 100000101100011011110… |
… | …1000010110000001100101 |
3 | 120220120102120220001110101 |
4 | 1001120313220112001211 |
5 | 1042110111043130334 |
6 | 13320134325424101 |
7 | 642433232163046 |
oct | 101306750260145 |
9 | 16816376801411 |
10 | 4493469114469 |
11 | 1482740197105 |
12 | 606a4586b031 |
13 | 267969ba05aa |
14 | 1176b103c8cd |
15 | 7bd4358b214 |
hex | 41637a16065 |
4493469114469 has 2 divisors, whose sum is σ = 4493469114470. Its totient is φ = 4493469114468.
The previous prime is 4493469114457. The next prime is 4493469114587. The reversal of 4493469114469 is 9644119643944.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2953115082369 + 1540354032100 = 1718463^2 + 1241110^2 .
It is a cyclic number.
It is not a de Polignac number, because 4493469114469 - 29 = 4493469113957 is a prime.
It is a super-2 number, since 2×44934691144692 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4493469114469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4493469114419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2246734557234 + 2246734557235.
It is an arithmetic number, because the mean of its divisors is an integer number (2246734557235).
Almost surely, 24493469114469 is an apocalyptic number.
It is an amenable number.
4493469114469 is a deficient number, since it is larger than the sum of its proper divisors (1).
4493469114469 is an equidigital number, since it uses as much as digits as its factorization.
4493469114469 is an evil number, because the sum of its binary digits is even.
The product of its digits is 80621568, while the sum is 64.
The spelling of 4493469114469 in words is "four trillion, four hundred ninety-three billion, four hundred sixty-nine million, one hundred fourteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •