Base | Representation |
---|---|
bin | 100101110000000100… |
… | …111101101110001101 |
3 | 10212121221212011022102 |
4 | 211300010331232031 |
5 | 1131003433231440 |
6 | 30342130524445 |
7 | 2633332166426 |
oct | 456004755615 |
9 | 125557764272 |
10 | 40535055245 |
11 | 16210a88a63 |
12 | 7a33136725 |
13 | 3a8cb8c5b9 |
14 | 1d6768a64d |
15 | 10c3976b15 |
hex | 97013db8d |
40535055245 has 4 divisors (see below), whose sum is σ = 48642066300. Its totient is φ = 32428044192.
The previous prime is 40535055227. The next prime is 40535055257. The reversal of 40535055245 is 54255053504.
40535055245 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6684207049 + 33850848196 = 81757^2 + 183986^2 .
It is a cyclic number.
It is not a de Polignac number, because 40535055245 - 26 = 40535055181 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 40535055199 and 40535055208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4053505520 + ... + 4053505529.
It is an arithmetic number, because the mean of its divisors is an integer number (12160516575).
Almost surely, 240535055245 is an apocalyptic number.
It is an amenable number.
40535055245 is a deficient number, since it is larger than the sum of its proper divisors (8107011055).
40535055245 is an equidigital number, since it uses as much as digits as its factorization.
40535055245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8107011054.
The product of its (nonzero) digits is 300000, while the sum is 38.
The spelling of 40535055245 in words is "forty billion, five hundred thirty-five million, fifty-five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.278 sec. • engine limits •