Base | Representation |
---|---|
bin | 10110111110101001011011… |
… | …001101111010110001010101 |
3 | 111020211102222021021001112112 |
4 | 112332221123031322301111 |
5 | 101221300200334201013 |
6 | 554535143124200405 |
7 | 30200332214333066 |
oct | 2676513315726125 |
9 | 436742867231475 |
10 | 101062110850133 |
11 | 2a224222989074 |
12 | b402620539105 |
13 | 44511682882c4 |
14 | 1ad560a1c056d |
15 | ba3ccdc45ba8 |
hex | 5bea5b37ac55 |
101062110850133 has 16 divisors (see below), whose sum is σ = 106019089056000. Its totient is φ = 96152349997440.
The previous prime is 101062110850079. The next prime is 101062110850157. The reversal of 101062110850133 is 331058011260101.
It is a cyclic number.
It is not a de Polignac number, because 101062110850133 - 216 = 101062110784597 is a prime.
It is a super-2 number, since 2×1010621108501332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101062110850133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101062110850033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11247203 + ... + 18127983.
It is an arithmetic number, because the mean of its divisors is an integer number (6626193066000).
Almost surely, 2101062110850133 is an apocalyptic number.
It is an amenable number.
101062110850133 is a deficient number, since it is larger than the sum of its proper divisors (4956978205867).
101062110850133 is a wasteful number, since it uses less digits than its factorization.
101062110850133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6884212.
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 101062110850133 in words is "one hundred one trillion, sixty-two billion, one hundred ten million, eight hundred fifty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •