Base | Representation |
---|---|
bin | 10101011110000110100111… |
… | …001100100110100000100000 |
3 | 110101100012022001120212121210 |
4 | 111132012213030212200200 |
5 | 44334100322220213323 |
6 | 532455245121150120 |
7 | 25614113320045500 |
oct | 2536064714464040 |
9 | 411305261525553 |
10 | 94427661101088 |
11 | 280a6600a70847 |
12 | a71086878b340 |
13 | 408c64b074b23 |
14 | 1946474b57a00 |
15 | adb430852293 |
hex | 55e1a7326820 |
94427661101088 has 1152 divisors, whose sum is σ = 323377812172800. Its totient is φ = 23924431060992.
The previous prime is 94427661101057. The next prime is 94427661101107. The reversal of 94427661101088 is 88010116672449.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 50254209333 + ... + 50254211211.
It is an arithmetic number, because the mean of its divisors is an integer number (280709906400).
Almost surely, 294427661101088 is an apocalyptic number.
94427661101088 is a gapful number since it is divisible by the number (98) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 94427661101088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161688906086400).
94427661101088 is an abundant number, since it is smaller than the sum of its proper divisors (228950151071712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
94427661101088 is a wasteful number, since it uses less digits than its factorization.
94427661101088 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2342 (or 2327 counting only the distinct ones).
The product of its (nonzero) digits is 4644864, while the sum is 57.
The spelling of 94427661101088 in words is "ninety-four trillion, four hundred twenty-seven billion, six hundred sixty-one million, one hundred one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •