Base | Representation |
---|---|
bin | 10110110000101110001000… |
… | …111111000101010011100011 |
3 | 111010102221202121101211100110 |
4 | 112300232020333011103203 |
5 | 101110110221324143201 |
6 | 552523352030022403 |
7 | 30041232503020431 |
oct | 2660561077052343 |
9 | 433387677354313 |
10 | 100105101006051 |
11 | 29995375868659 |
12 | b289057947a03 |
13 | 43b1b416ba95b |
14 | 1aa1181507d51 |
15 | b88e6b7636d6 |
hex | 5b0b88fc54e3 |
100105101006051 has 8 divisors (see below), whose sum is σ = 133473526432960. Its totient is φ = 66736704791592.
The previous prime is 100105101006023. The next prime is 100105101006061. The reversal of 100105101006051 is 150600101501001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100105101006051 - 210 = 100105101005027 is a prime.
It is a super-2 number, since 2×1001051010060512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100105101006061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2618196 + ... + 14389758.
It is an arithmetic number, because the mean of its divisors is an integer number (16684190804120).
Almost surely, 2100105101006051 is an apocalyptic number.
100105101006051 is a deficient number, since it is larger than the sum of its proper divisors (33368425426909).
100105101006051 is a wasteful number, since it uses less digits than its factorization.
100105101006051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14606225.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 100105101006051 its reverse (150600101501001), we get a palindrome (250705202507052).
The spelling of 100105101006051 in words is "one hundred trillion, one hundred five billion, one hundred one million, six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •