Base | Representation |
---|---|
bin | 10010010011100001010101… |
… | …10000000111010101001010 |
3 | 12021112011102021201202112212 |
4 | 21021300222300013111022 |
5 | 20234001423043112442 |
6 | 221340013035305122 |
7 | 11323123412666405 |
oct | 1111605260072512 |
9 | 167464367652485 |
10 | 40253150754122 |
11 | 1190a2a1226549 |
12 | 46213b68ab1a2 |
13 | 195cb183420b7 |
14 | 9d2397536d3c |
15 | 49c124457a82 |
hex | 249c2ac0754a |
40253150754122 has 4 divisors (see below), whose sum is σ = 60379726131186. Its totient is φ = 20126575377060.
The previous prime is 40253150754059. The next prime is 40253150754139. The reversal of 40253150754122 is 22145705135204.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 40223995533121 + 29155221001 = 6342239^2 + 170749^2 .
It is a super-2 number, since 2×402531507541222 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40253150754122.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10063287688529 + ... + 10063287688532.
Almost surely, 240253150754122 is an apocalyptic number.
40253150754122 is a deficient number, since it is larger than the sum of its proper divisors (20126575377064).
40253150754122 is a wasteful number, since it uses less digits than its factorization.
40253150754122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20126575377063.
The product of its (nonzero) digits is 336000, while the sum is 41.
Adding to 40253150754122 its reverse (22145705135204), we get a palindrome (62398855889326).
The spelling of 40253150754122 in words is "forty trillion, two hundred fifty-three billion, one hundred fifty million, seven hundred fifty-four thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •