Base | Representation |
---|---|
bin | 101101101000100111101011… |
… | …0010001110101101100001101 |
3 | 1221122021010111001201010220202 |
4 | 1123101033112101311230031 |
5 | 410103122410020024303 |
6 | 3541415445405223245 |
7 | 150356460155334446 |
oct | 13321172621655415 |
9 | 1848233431633822 |
10 | 401406943517453 |
11 | 10699a801a5a365 |
12 | 3902b431261b25 |
13 | 142c9687842923 |
14 | 711a2b20aa2cd |
15 | 31617b0b4bc88 |
hex | 16d13d6475b0d |
401406943517453 has 2 divisors, whose sum is σ = 401406943517454. Its totient is φ = 401406943517452.
The previous prime is 401406943517441. The next prime is 401406943517473. The reversal of 401406943517453 is 354715349604104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 210724068930244 + 190682874587209 = 14516338^2 + 13808797^2 .
It is a cyclic number.
It is not a de Polignac number, because 401406943517453 - 226 = 401406876408589 is a prime.
It is a super-2 number, since 2×4014069435174532 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (401406943517473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200703471758726 + 200703471758727.
It is an arithmetic number, because the mean of its divisors is an integer number (200703471758727).
Almost surely, 2401406943517453 is an apocalyptic number.
It is an amenable number.
401406943517453 is a deficient number, since it is larger than the sum of its proper divisors (1).
401406943517453 is an equidigital number, since it uses as much as digits as its factorization.
401406943517453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21772800, while the sum is 56.
The spelling of 401406943517453 in words is "four hundred one trillion, four hundred six billion, nine hundred forty-three million, five hundred seventeen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •