Base | Representation |
---|---|
bin | 10110110000000000100000… |
… | …111001101000001111100100 |
3 | 111010021021022100101020000221 |
4 | 112300000200321220033210 |
5 | 101103304403141334242 |
6 | 552445050433014124 |
7 | 30034546453154665 |
oct | 2660004071501744 |
9 | 433237270336027 |
10 | 100056110105572 |
11 | 29976615773a55 |
12 | b27b6649b4344 |
13 | 43aa334a22b4a |
14 | 1a9ca54c1336c |
15 | b87a5079b167 |
hex | 5b0020e683e4 |
100056110105572 has 48 divisors (see below), whose sum is σ = 193011974870400. Its totient is φ = 45173014951680.
The previous prime is 100056110105543. The next prime is 100056110105597. The reversal of 100056110105572 is 275501011650001.
It is a super-2 number, since 2×1000561101055722 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 101359947 + ... + 102342322.
It is an arithmetic number, because the mean of its divisors is an integer number (4021082809800).
Almost surely, 2100056110105572 is an apocalyptic number.
It is an amenable number.
100056110105572 is a deficient number, since it is larger than the sum of its proper divisors (92955864764828).
100056110105572 is a wasteful number, since it uses less digits than its factorization.
100056110105572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203702596 (or 203702594 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 34.
Adding to 100056110105572 its reverse (275501011650001), we get a palindrome (375557121755573).
The spelling of 100056110105572 in words is "one hundred trillion, fifty-six billion, one hundred ten million, one hundred five thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •