Base | Representation |
---|---|
bin | 101011001110010101010111… |
… | …001110110110111010101001 |
3 | 220221002110221022102022122021 |
4 | 223032111113032312322221 |
5 | 144404103332304013001 |
6 | 1512151110540424441 |
7 | 55020226161165412 |
oct | 5316252716667251 |
9 | 827073838368567 |
10 | 190101011001001 |
11 | 55632427872451 |
12 | 193a2a23b48121 |
13 | 820c5aa232649 |
14 | 34d2d1bd28809 |
15 | 16e9e6bedbba1 |
hex | ace5573b6ea9 |
190101011001001 has 8 divisors (see below), whose sum is σ = 192938675976320. Its totient is φ = 187263355921488.
The previous prime is 190101011000963. The next prime is 190101011001017. The reversal of 190101011001001 is 100100110101091.
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 190101011001001 - 223 = 190101002612393 is a prime.
It is a super-2 number, since 2×1901010110010012 (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 (190101011001091) 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, 42213040 + ... + 46498846.
It is an arithmetic number, because the mean of its divisors is an integer number (24117334497040).
Almost surely, 2190101011001001 is an apocalyptic number.
It is an amenable number.
190101011001001 is a deficient number, since it is larger than the sum of its proper divisors (2837664975319).
190101011001001 is an equidigital number, since it uses as much as digits as its factorization.
190101011001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4947903.
The product of its (nonzero) digits is 9, while the sum is 16.
Adding to 190101011001001 its reverse (100100110101091), we get a palindrome (290201121102092).
The spelling of 190101011001001 in words is "one hundred ninety trillion, one hundred one billion, eleven million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •