Base | Representation |
---|---|
bin | 10010001111101011011001… |
… | …01101101010000110111101 |
3 | 12021001112121101012020012220 |
4 | 21013311230231222012331 |
5 | 20224321020013421341 |
6 | 221155215101115553 |
7 | 11310440410115151 |
oct | 1107655455520675 |
9 | 167045541166186 |
10 | 40121113420221 |
11 | 118692a5630299 |
12 | 45bb8a7858bb9 |
13 | 1950535351062 |
14 | 9c9c2d655061 |
15 | 498997809a66 |
hex | 247d6cb6a1bd |
40121113420221 has 8 divisors (see below), whose sum is σ = 53497922530944. Its totient is φ = 26745856628160.
The previous prime is 40121113420217. The next prime is 40121113420229. The reversal of 40121113420221 is 12202431112104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40121113420221 - 22 = 40121113420217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40121113420191 and 40121113420200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40121113420229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 388019356 + ... + 388122741.
It is an arithmetic number, because the mean of its divisors is an integer number (6687240316368).
Almost surely, 240121113420221 is an apocalyptic number.
It is an amenable number.
40121113420221 is a deficient number, since it is larger than the sum of its proper divisors (13376809110723).
40121113420221 is a wasteful number, since it uses less digits than its factorization.
40121113420221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 776159331.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 40121113420221 its reverse (12202431112104), we get a palindrome (52323544532325).
The spelling of 40121113420221 in words is "forty trillion, one hundred twenty-one billion, one hundred thirteen million, four hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •