Base | Representation |
---|---|
bin | 100100101011001111100… |
… | …1001001001000111111110 |
3 | 122211212211201112001222020 |
4 | 1021112133021021013332 |
5 | 1130041241123042342 |
6 | 14415352243101010 |
7 | 1030114263155613 |
oct | 111263711110776 |
9 | 18755751461866 |
10 | 5040666612222 |
11 | 167380999019a |
12 | 694ab9071766 |
13 | 2a7443295c17 |
14 | 135d806ba50a |
15 | 8b1bc9d30ec |
hex | 4959f2491fe |
5040666612222 has 8 divisors (see below), whose sum is σ = 10081333224456. Its totient is φ = 1680222204072.
The previous prime is 5040666612221. The next prime is 5040666612227. The reversal of 5040666612222 is 2222166660405.
It is a sphenic number, since it is the product of 3 distinct primes.
5040666612222 is an admirable number.
It is a super-2 number, since 2×50406666122222 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5040666612221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 420055551013 + ... + 420055551024.
It is an arithmetic number, because the mean of its divisors is an integer number (1260166653057).
Almost surely, 25040666612222 is an apocalyptic number.
5040666612222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5040666612222 is a wasteful number, since it uses less digits than its factorization.
5040666612222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 840111102042.
The product of its (nonzero) digits is 414720, while the sum is 42.
The spelling of 5040666612222 in words is "five trillion, forty billion, six hundred sixty-six million, six hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •