Base | Representation |
---|---|
bin | 10110110000110010101110… |
… | …001100000001010111101011 |
3 | 111010110102110102120210222102 |
4 | 112300302232030001113223 |
5 | 101110200310122401331 |
6 | 552525524111444015 |
7 | 30041465423560550 |
oct | 2660625614012753 |
9 | 433412412523872 |
10 | 100110020122091 |
11 | 2999746a550311 |
12 | b289bab22660b |
13 | 43b24468699c5 |
14 | 1aa14ca952a27 |
15 | b8915853e4cb |
hex | 5b0cae3015eb |
100110020122091 has 16 divisors (see below), whose sum is σ = 114482558169600. Its totient is φ = 85755260969280.
The previous prime is 100110020122027. The next prime is 100110020122097. The reversal of 100110020122091 is 190221020011001.
It is not a de Polignac number, because 100110020122091 - 26 = 100110020122027 is a prime.
It is a super-2 number, since 2×1001100201220912 (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 (100110020122097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1043732426 + ... + 1043828336.
It is an arithmetic number, because the mean of its divisors is an integer number (7155159885600).
Almost surely, 2100110020122091 is an apocalyptic number.
100110020122091 is a deficient number, since it is larger than the sum of its proper divisors (14372538047509).
100110020122091 is an equidigital number, since it uses as much as digits as its factorization.
100110020122091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187034.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 100110020122091 its reverse (190221020011001), we get a palindrome (290331040133092).
The spelling of 100110020122091 in words is "one hundred trillion, one hundred ten billion, twenty million, one hundred twenty-two thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •