Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …111011001111100101110011 |
3 | 111020121121021202020222021202 |
4 | 112331300201323033211303 |
5 | 101214300042122024334 |
6 | 554451121133441415 |
7 | 30163040301533414 |
oct | 2675604173174563 |
9 | 436547252228252 |
10 | 101001020111219 |
11 | 2a200323841798 |
12 | b3b281134026b |
13 | 4448480870897 |
14 | 1ad269291d80b |
15 | ba240588b17e |
hex | 5bdc21ecf973 |
101001020111219 has 4 divisors (see below), whose sum is σ = 101122854876960. Its totient is φ = 100879185345480.
The previous prime is 101001020111207. The next prime is 101001020111267. The reversal of 101001020111219 is 912111020100101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101001020111219 - 24 = 101001020111203 is a prime.
It is a super-2 number, since 2×1010010201112192 (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 101001020111219.
It is not an unprimeable number, because it can be changed into a prime (101001020111119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60917381627 + ... + 60917383284.
It is an arithmetic number, because the mean of its divisors is an integer number (25280713719240).
Almost surely, 2101001020111219 is an apocalyptic number.
101001020111219 is a deficient number, since it is larger than the sum of its proper divisors (121834765741).
101001020111219 is an equidigital number, since it uses as much as digits as its factorization.
101001020111219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121834765740.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 101001020111219 in words is "one hundred one trillion, one billion, twenty million, one hundred eleven thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •