Base | Representation |
---|---|
bin | 10010011000110010011000… |
… | …11011000111111000011001 |
3 | 12022011110111020202111010102 |
4 | 21030121030123013320121 |
5 | 20244433021200200004 |
6 | 221555100542025145 |
7 | 11342160540533645 |
oct | 1114311433077031 |
9 | 168143436674112 |
10 | 40434104303129 |
11 | 1197a009845159 |
12 | 46504978781b5 |
13 | 1973bc56ab914 |
14 | 9db041c2bc25 |
15 | 4a1bb571911e |
hex | 24c64c6c7e19 |
40434104303129 has 2 divisors, whose sum is σ = 40434104303130. Its totient is φ = 40434104303128.
The previous prime is 40434104303113. The next prime is 40434104303149. The reversal of 40434104303129 is 92130340143404.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 40409516495104 + 24587808025 = 6356848^2 + 156805^2 .
It is a cyclic number.
It is not a de Polignac number, because 40434104303129 - 24 = 40434104303113 is a prime.
It is a super-2 number, since 2×404341043031292 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40434104303092 and 40434104303101.
It is not a weakly prime, because it can be changed into another prime (40434104303149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20217052151564 + 20217052151565.
It is an arithmetic number, because the mean of its divisors is an integer number (20217052151565).
Almost surely, 240434104303129 is an apocalyptic number.
It is an amenable number.
40434104303129 is a deficient number, since it is larger than the sum of its proper divisors (1).
40434104303129 is an equidigital number, since it uses as much as digits as its factorization.
40434104303129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 124416, while the sum is 38.
The spelling of 40434104303129 in words is "forty trillion, four hundred thirty-four billion, one hundred four million, three hundred three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •