Base | Representation |
---|---|
bin | 10010011011000000110001… |
… | …01010000001000011111001 |
3 | 12022102202210112210120012201 |
4 | 21031200120222001003321 |
5 | 20302211044033002244 |
6 | 222054142035510201 |
7 | 11350535034501436 |
oct | 1115403052010371 |
9 | 168382715716181 |
10 | 40510545203449 |
11 | 119a9475728a42 |
12 | 466326b758361 |
13 | 197b188353b99 |
14 | a00a14022b8d |
15 | 4a3b8b504ad4 |
hex | 24d818a810f9 |
40510545203449 has 2 divisors, whose sum is σ = 40510545203450. Its totient is φ = 40510545203448.
The previous prime is 40510545203431. The next prime is 40510545203473. The reversal of 40510545203449 is 94430254501504.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25402608010000 + 15107937193449 = 5040100^2 + 3886893^2 .
It is a cyclic number.
It is not a de Polignac number, because 40510545203449 - 27 = 40510545203321 is a prime.
It is a super-2 number, since 2×405105452034492 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40510545203399 and 40510545203408.
It is not a weakly prime, because it can be changed into another prime (40510545203419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20255272601724 + 20255272601725.
It is an arithmetic number, because the mean of its divisors is an integer number (20255272601725).
Almost surely, 240510545203449 is an apocalyptic number.
It is an amenable number.
40510545203449 is a deficient number, since it is larger than the sum of its proper divisors (1).
40510545203449 is an equidigital number, since it uses as much as digits as its factorization.
40510545203449 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728000, while the sum is 46.
The spelling of 40510545203449 in words is "forty trillion, five hundred ten billion, five hundred forty-five million, two hundred three thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •