Base | Representation |
---|---|
bin | 10010100010100000100010… |
… | …11001011010111100000111 |
3 | 12100100101122110221122010020 |
4 | 21101100101121122330013 |
5 | 20320421103042401442 |
6 | 222412341052430223 |
7 | 11405254024456332 |
oct | 1121202131327407 |
9 | 170311573848106 |
10 | 40768121450247 |
11 | 11a98732810584 |
12 | 46a5175478373 |
13 | 1999556c18a39 |
14 | a0d28ab13619 |
15 | 4aa7145129ec |
hex | 25141165af07 |
40768121450247 has 64 divisors (see below), whose sum is σ = 57908657479680. Its totient is φ = 25423408682496.
The previous prime is 40768121450237. The next prime is 40768121450267. The reversal of 40768121450247 is 74205412186704.
It is not a de Polignac number, because 40768121450247 - 211 = 40768121448199 is a prime.
It is a super-2 number, since 2×407681214502472 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 40768121450247.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40768121450227) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 14733689058 + ... + 14733691824.
It is an arithmetic number, because the mean of its divisors is an integer number (904822773120).
Almost surely, 240768121450247 is an apocalyptic number.
40768121450247 is a deficient number, since it is larger than the sum of its proper divisors (17140536029433).
40768121450247 is a wasteful number, since it uses less digits than its factorization.
40768121450247 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5540.
The product of its (nonzero) digits is 3010560, while the sum is 51.
The spelling of 40768121450247 in words is "forty trillion, seven hundred sixty-eight billion, one hundred twenty-one million, four hundred fifty thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •