Base | Representation |
---|---|
bin | 10010010010110011111011… |
… | …10011100110000001111011 |
3 | 12021102211111110021012220001 |
4 | 21021121331303212001323 |
5 | 20233102012214341301 |
6 | 221320502133013431 |
7 | 11321301350110351 |
oct | 1111317563460173 |
9 | 167384443235801 |
10 | 40228774371451 |
11 | 118aaa22409446 |
12 | 4618733184277 |
13 | 195a732083223 |
14 | 9d1123d237d1 |
15 | 49b6993bac01 |
hex | 24967dce607b |
40228774371451 has 4 divisors (see below), whose sum is σ = 40228797127432. Its totient is φ = 40228751615472.
The previous prime is 40228774371421. The next prime is 40228774371479. The reversal of 40228774371451 is 15417347782204.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40228774371451 - 27 = 40228774371323 is a prime.
It is a super-2 number, since 2×402287743714512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40228774371392 and 40228774371401.
It is not an unprimeable number, because it can be changed into a prime (40228774371421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8480241 + ... + 12343906.
It is an arithmetic number, because the mean of its divisors is an integer number (10057199281858).
Almost surely, 240228774371451 is an apocalyptic number.
40228774371451 is a deficient number, since it is larger than the sum of its proper divisors (22755981).
40228774371451 is a wasteful number, since it uses less digits than its factorization.
40228774371451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22755980.
The product of its (nonzero) digits is 10536960, while the sum is 55.
The spelling of 40228774371451 in words is "forty trillion, two hundred twenty-eight billion, seven hundred seventy-four million, three hundred seventy-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •