Base | Representation |
---|---|
bin | 100101000111000110011100… |
… | …1000010101011011100101101 |
3 | 1120210210112101111010020202212 |
4 | 1022032030321002223130231 |
5 | 320241222404214321303 |
6 | 3114132254522100205 |
7 | 125520613214112212 |
oct | 11216147102533455 |
9 | 1523715344106685 |
10 | 326431356401453 |
11 | 95013840705876 |
12 | 3074070094a665 |
13 | 1101b463773a74 |
14 | 5a8750d293b09 |
15 | 27b1366cd1ad8 |
hex | 128e3390ab72d |
326431356401453 has 2 divisors, whose sum is σ = 326431356401454. Its totient is φ = 326431356401452.
The previous prime is 326431356401429. The next prime is 326431356401459. The reversal of 326431356401453 is 354104653134623.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 203568918346564 + 122862438054889 = 14267758^2 + 11084333^2 .
It is a cyclic number.
It is not a de Polignac number, because 326431356401453 - 218 = 326431356139309 is a prime.
It is a super-2 number, since 2×3264313564014532 (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 (326431356401459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 163215678200726 + 163215678200727.
It is an arithmetic number, because the mean of its divisors is an integer number (163215678200727).
Almost surely, 2326431356401453 is an apocalyptic number.
It is an amenable number.
326431356401453 is a deficient number, since it is larger than the sum of its proper divisors (1).
326431356401453 is an equidigital number, since it uses as much as digits as its factorization.
326431356401453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9331200, while the sum is 50.
The spelling of 326431356401453 in words is "three hundred twenty-six trillion, four hundred thirty-one billion, three hundred fifty-six million, four hundred one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •