Base | Representation |
---|---|
bin | 10110111111100000010001… |
… | …111000011000101101111001 |
3 | 111021001002000001102102220001 |
4 | 112333200101320120231321 |
5 | 101223231312030323001 |
6 | 555022203425433001 |
7 | 30204515616051211 |
oct | 2677402170305571 |
9 | 437032001372801 |
10 | 101121010011001 |
11 | 2a2471a7a28422 |
12 | b411b1979b761 |
13 | 445689392c896 |
14 | 1ad83d6797241 |
15 | ba55c99e9001 |
hex | 5bf811e18b79 |
101121010011001 has 8 divisors (see below), whose sum is σ = 104408112564224. Its totient is φ = 97835478363360.
The previous prime is 101121010010963. The next prime is 101121010011011. The reversal of 101121010011001 is 100110010121101.
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 101121010011001 - 223 = 101121001622393 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101121010011011) 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, 392595561 + ... + 392853046.
It is an arithmetic number, because the mean of its divisors is an integer number (13051014070528).
Almost surely, 2101121010011001 is an apocalyptic number.
It is an amenable number.
101121010011001 is a deficient number, since it is larger than the sum of its proper divisors (3287102553223).
101121010011001 is an equidigital number, since it uses as much as digits as its factorization.
101121010011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 785452791.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 101121010011001 its reverse (100110010121101), we get a palindrome (201231020132102).
It can be divided in two parts, 1011210100 and 11001, that added together give a palindrome (1011221101).
The spelling of 101121010011001 in words is "one hundred one trillion, one hundred twenty-one billion, ten million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •