Base | Representation |
---|---|
bin | 11000011000010100101000… |
… | …101101000011011001001000 |
3 | 112001122120021122121200221000 |
4 | 120120110220231003121020 |
5 | 103023231330102144111 |
6 | 1020014135130415000 |
7 | 31404501044164050 |
oct | 3030245055033110 |
9 | 461576248550830 |
10 | 107224541443656 |
11 | 3118a74434155a |
12 | 10038a01b91460 |
13 | 47aa3002c2820 |
14 | 1c699a4628560 |
15 | c5e252c36c56 |
hex | 618528b43648 |
107224541443656 has 128 divisors (see below), whose sum is σ = 366579628934400. Its totient is φ = 28278999936000.
The previous prime is 107224541443633. The next prime is 107224541443727. The reversal of 107224541443656 is 656344145422701.
107224541443656 is a `hidden beast` number, since 1 + 0 + 7 + 2 + 2 + 4 + 541 + 4 + 43 + 6 + 56 = 666.
It is a super-2 number, since 2×1072245414436562 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2727507345 + ... + 2727546656.
It is an arithmetic number, because the mean of its divisors is an integer number (2863903351050).
Almost surely, 2107224541443656 is an apocalyptic number.
It is an amenable number.
107224541443656 is an abundant number, since it is smaller than the sum of its proper divisors (259355087490744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107224541443656 is a wasteful number, since it uses less digits than its factorization.
107224541443656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5455054036 (or 5455054026 counting only the distinct ones).
The product of its (nonzero) digits is 19353600, while the sum is 54.
The spelling of 107224541443656 in words is "one hundred seven trillion, two hundred twenty-four billion, five hundred forty-one million, four hundred forty-three thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •