Base | Representation |
---|---|
bin | 10110111111100001001100… |
… | …111101000110000011001001 |
3 | 111021001011120010100000210002 |
4 | 112333201030331012003021 |
5 | 101223240324240213001 |
6 | 555022450032132345 |
7 | 30204552312142346 |
oct | 2677411475060311 |
9 | 437034503300702 |
10 | 101122001101001 |
11 | 2a247666415a71 |
12 | b4121556970b5 |
13 | 44569c106a37a |
14 | 1ad848c2657cd |
15 | ba5636a1a46b |
hex | 5bf84cf460c9 |
101122001101001 has 4 divisors (see below), whose sum is σ = 101122325498112. Its totient is φ = 101121676703892.
The previous prime is 101122001100949. The next prime is 101122001101019. The reversal of 101122001101001 is 100101100221101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101122001101001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (101122001101091) 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, 161730521 + ... + 162354566.
It is an arithmetic number, because the mean of its divisors is an integer number (25280581374528).
Almost surely, 2101122001101001 is an apocalyptic number.
It is an amenable number.
101122001101001 is a deficient number, since it is larger than the sum of its proper divisors (324397111).
101122001101001 is an equidigital number, since it uses as much as digits as its factorization.
101122001101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324397110.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101122001101001 its reverse (100101100221101), we get a palindrome (201223101322102).
The spelling of 101122001101001 in words is "one hundred one trillion, one hundred twenty-two billion, one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •