Base | Representation |
---|---|
bin | 101101100111010111010000… |
… | …1010101110001100100101001 |
3 | 1221121122121202012221002221221 |
4 | 1123032232201111301210221 |
5 | 410042310224201233443 |
6 | 3541204250050502041 |
7 | 150341134630322032 |
oct | 13316564125614451 |
9 | 1847577665832857 |
10 | 401234256664873 |
11 | 106933546806075 |
12 | 39001a78894921 |
13 | 142b62c7056458 |
14 | 7111bad663a89 |
15 | 315c0554b6eed |
hex | 16ceba1571929 |
401234256664873 has 2 divisors, whose sum is σ = 401234256664874. Its totient is φ = 401234256664872.
The previous prime is 401234256664867. The next prime is 401234256665003. The reversal of 401234256664873 is 378466652432104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 401086657013904 + 147599650969 = 20027148^2 + 384187^2 .
It is a cyclic number.
It is not a de Polignac number, because 401234256664873 - 229 = 401233719793961 is a prime.
It is a super-2 number, since 2×4012342566648732 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (401234256664853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200617128332436 + 200617128332437.
It is an arithmetic number, because the mean of its divisors is an integer number (200617128332437).
Almost surely, 2401234256664873 is an apocalyptic number.
It is an amenable number.
401234256664873 is a deficient number, since it is larger than the sum of its proper divisors (1).
401234256664873 is an equidigital number, since it uses as much as digits as its factorization.
401234256664873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139345920, while the sum is 61.
The spelling of 401234256664873 in words is "four hundred one trillion, two hundred thirty-four billion, two hundred fifty-six million, six hundred sixty-four thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •