Base | Representation |
---|---|
bin | 10110111101111000111001… |
… | …110001110010111000100111 |
3 | 111020122110111021201221000010 |
4 | 112331320321301302320213 |
5 | 101214422000104101434 |
6 | 554455205203021303 |
7 | 30163506134316315 |
oct | 2675707161627047 |
9 | 436573437657003 |
10 | 101010010222119 |
11 | 2a204117499109 |
12 | b3b450006a833 |
13 | 444928426a92b |
14 | 1ad2ca68bd0b5 |
15 | ba277ec629e9 |
hex | 5bde39c72e27 |
101010010222119 has 8 divisors (see below), whose sum is σ = 135663079422960. Its totient is φ = 66848473918016.
The previous prime is 101010010222109. The next prime is 101010010222321. The reversal of 101010010222119 is 911222010010101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101010010222119 - 221 = 101010008124967 is a prime.
It is a super-2 number, since 2×1010100102221192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101010010222095 and 101010010222104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101010010222109) 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, 122883223704 + ... + 122883224525.
It is an arithmetic number, because the mean of its divisors is an integer number (16957884927870).
Almost surely, 2101010010222119 is an apocalyptic number.
101010010222119 is a deficient number, since it is larger than the sum of its proper divisors (34653069200841).
101010010222119 is a wasteful number, since it uses less digits than its factorization.
101010010222119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 245766448369.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 101010010222119 in words is "one hundred one trillion, ten billion, ten million, two hundred twenty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •