Base | Representation |
---|---|
bin | 11101001000101110111… |
… | …10010011101111001001 |
3 | 10112201001212011100020121 |
4 | 32210113132103233021 |
5 | 112400244011413342 |
6 | 2043524141423241 |
7 | 132220500542623 |
oct | 16442736235711 |
9 | 3481055140217 |
10 | 1001121201097 |
11 | 356633900976 |
12 | 14203556ab21 |
13 | 73536660544 |
14 | 36651303c13 |
15 | 1b094dd9067 |
hex | e917793bc9 |
1001121201097 has 8 divisors (see below), whose sum is σ = 1015321063680. Its totient is φ = 986924104320.
The previous prime is 1001121201023. The next prime is 1001121201137. The reversal of 1001121201097 is 7901021211001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1001121201097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001121201007) 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 7 ways as a sum of consecutive naturals, for example, 43104 + ... + 1415662.
It is an arithmetic number, because the mean of its divisors is an integer number (126915132960).
Almost surely, 21001121201097 is an apocalyptic number.
It is an amenable number.
1001121201097 is a deficient number, since it is larger than the sum of its proper divisors (14199862583).
1001121201097 is a wasteful number, since it uses less digits than its factorization.
1001121201097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1382903.
The product of its (nonzero) digits is 252, while the sum is 25.
Adding to 1001121201097 its reverse (7901021211001), we get a palindrome (8902142412098).
The spelling of 1001121201097 in words is "one trillion, one billion, one hundred twenty-one million, two hundred one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •