Base | Representation |
---|---|
bin | 100101011110110000… |
… | …010010011100110101 |
3 | 10211212200222111001221 |
4 | 211132300102130311 |
5 | 1124410033004303 |
6 | 30253225350341 |
7 | 2623202642464 |
oct | 453660223465 |
9 | 124780874057 |
10 | 40244422453 |
11 | 16081a22274 |
12 | 79719383b1 |
13 | 3a448c1331 |
14 | 1d3ac349db |
15 | 10a81b84bd |
hex | 95ec12735 |
40244422453 has 2 divisors, whose sum is σ = 40244422454. Its totient is φ = 40244422452.
The previous prime is 40244422433. The next prime is 40244422459. The reversal of 40244422453 is 35422444204.
40244422453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31200983044 + 9043439409 = 176638^2 + 95097^2 .
It is a cyclic number.
It is not a de Polignac number, because 40244422453 - 233 = 31654487861 is a prime.
It is a super-2 number, since 2×402444224532 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40244422459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20122211226 + 20122211227.
It is an arithmetic number, because the mean of its divisors is an integer number (20122211227).
Almost surely, 240244422453 is an apocalyptic number.
It is an amenable number.
40244422453 is a deficient number, since it is larger than the sum of its proper divisors (1).
40244422453 is an equidigital number, since it uses as much as digits as its factorization.
40244422453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 122880, while the sum is 34.
Adding to 40244422453 its reverse (35422444204), we get a palindrome (75666866657).
The spelling of 40244422453 in words is "forty billion, two hundred forty-four million, four hundred twenty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •