Base | Representation |
---|---|
bin | 10110110000101001100110… |
… | …001011001110110110010011 |
3 | 111010102111011120201201002211 |
4 | 112300221212023032312103 |
5 | 101110020223314133021 |
6 | 552521223540252551 |
7 | 30041000550232312 |
oct | 2660514613166623 |
9 | 433374146651084 |
10 | 100100222021011 |
11 | 299932a17a5a13 |
12 | b2881159a1157 |
13 | 43b154494cc64 |
14 | 1aa0c3b548279 |
15 | b88c832633e1 |
hex | 5b0a662ced93 |
100100222021011 has 8 divisors (see below), whose sum is σ = 101146514525840. Its totient is φ = 99054221995008.
The previous prime is 100100222021003. The next prime is 100100222021047. The reversal of 100100222021011 is 110120222001001.
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 100100222021011 - 23 = 100100222021003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100100222020982 and 100100222021000.
It is not an unprimeable number, because it can be changed into a prime (100100222028011) 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, 72431601 + ... + 73800658.
It is an arithmetic number, because the mean of its divisors is an integer number (12643314315730).
Almost surely, 2100100222021011 is an apocalyptic number.
100100222021011 is a deficient number, since it is larger than the sum of its proper divisors (1046292504829).
100100222021011 is an equidigital number, since it uses as much as digits as its factorization.
100100222021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146239413.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100100222021011 its reverse (110120222001001), we get a palindrome (210220444022012).
The spelling of 100100222021011 in words is "one hundred trillion, one hundred billion, two hundred twenty-two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •