Base | Representation |
---|---|
bin | 10011001001011101000010… |
… | …01000100011100101111000 |
3 | 12112002022122012100021201222 |
4 | 21210232201020203211320 |
5 | 21004332114022334100 |
6 | 225315204040331212 |
7 | 11604035365541561 |
oct | 1144564110434570 |
9 | 175068565307658 |
10 | 42106267777400 |
11 | 124641934a7982 |
12 | 4880587a73b08 |
13 | 1a657b1032598 |
14 | a57d505c1168 |
15 | 4d0432313485 |
hex | 264ba1223978 |
42106267777400 has 24 divisors (see below), whose sum is σ = 97897072582920. Its totient is φ = 16842507110880.
The previous prime is 42106267777373. The next prime is 42106267777403. The reversal of 42106267777400 is 477776260124.
It is a super-2 number, since 2×421062677774002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42106267777403) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 105265669244 + ... + 105265669643.
It is an arithmetic number, because the mean of its divisors is an integer number (4079044690955).
Almost surely, 242106267777400 is an apocalyptic number.
42106267777400 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
42106267777400 is an abundant number, since it is smaller than the sum of its proper divisors (55790804805520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42106267777400 is a wasteful number, since it uses less digits than its factorization.
42106267777400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210531338903 (or 210531338894 counting only the distinct ones).
The product of its (nonzero) digits is 5531904, while the sum is 53.
The spelling of 42106267777400 in words is "forty-two trillion, one hundred six billion, two hundred sixty-seven million, seven hundred seventy-seven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •