Base | Representation |
---|---|
bin | 10010011011101100110111… |
… | …00000011110100000100001 |
3 | 12022112000220011100211002012 |
4 | 21031312123200132200201 |
5 | 20303103033112320101 |
6 | 222113054513202305 |
7 | 11352333433453046 |
oct | 1115663340364041 |
9 | 168460804324065 |
10 | 40534215354401 |
11 | 11a0851192a76a |
12 | 4667976860395 |
13 | 198048b201072 |
14 | a01c1b9191cd |
15 | 4a45c458cbbb |
hex | 24dd9b81e821 |
40534215354401 has 2 divisors, whose sum is σ = 40534215354402. Its totient is φ = 40534215354400.
The previous prime is 40534215354371. The next prime is 40534215354427. The reversal of 40534215354401 is 10445351243504.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39016763395600 + 1517451958801 = 6246340^2 + 1231849^2 .
It is a cyclic number.
It is not a de Polignac number, because 40534215354401 - 222 = 40534211160097 is a prime.
It is a super-2 number, since 2×405342153544012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40534215359401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20267107677200 + 20267107677201.
It is an arithmetic number, because the mean of its divisors is an integer number (20267107677201).
Almost surely, 240534215354401 is an apocalyptic number.
It is an amenable number.
40534215354401 is a deficient number, since it is larger than the sum of its proper divisors (1).
40534215354401 is an equidigital number, since it uses as much as digits as its factorization.
40534215354401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 40534215354401 its reverse (10445351243504), we get a palindrome (50979566597905).
The spelling of 40534215354401 in words is "forty trillion, five hundred thirty-four billion, two hundred fifteen million, three hundred fifty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •