Base | Representation |
---|---|
bin | 10111001101111010010011… |
… | …000100110010001011001011 |
3 | 111101112201101112212201111200 |
4 | 113031322103010302023023 |
5 | 101340441332104444242 |
6 | 1001101053251355243 |
7 | 30336164160110460 |
oct | 2715722304621313 |
9 | 441481345781450 |
10 | 102111019999947 |
11 | 2a599049841132 |
12 | b551971bb2b23 |
13 | 44c90492c777a |
14 | 1b302b211b667 |
15 | bc121e1c704c |
hex | 5cde931322cb |
102111019999947 has 12 divisors (see below), whose sum is σ = 168564223492080. Its totient is φ = 58349154285648.
The previous prime is 102111019999931. The next prime is 102111019999973. The reversal of 102111019999947 is 749999910111201.
It is not a de Polignac number, because 102111019999947 - 24 = 102111019999931 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63), and also a Moran number because the ratio is a prime number: 1620809841269 = 102111019999947 / (1 + 0 + 2 + 1 + 1 + 1 + 0 + 1 + 9 + 9 + 9 + 9 + 9 + 4 + 7).
It is not an unprimeable number, because it can be changed into a prime (102111019989947) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 810404920572 + ... + 810404920697.
It is an arithmetic number, because the mean of its divisors is an integer number (14047018624340).
Almost surely, 2102111019999947 is an apocalyptic number.
102111019999947 is a deficient number, since it is larger than the sum of its proper divisors (66453203492133).
102111019999947 is a wasteful number, since it uses less digits than its factorization.
102111019999947 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1620809841282 (or 1620809841279 counting only the distinct ones).
The product of its (nonzero) digits is 3306744, while the sum is 63.
The spelling of 102111019999947 in words is "one hundred two trillion, one hundred eleven billion, nineteen million, nine hundred ninety-nine thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •