Base | Representation |
---|---|
bin | 10111000000111101100110… |
… | …010101101010100000100001 |
3 | 111021101122122020200020222221 |
4 | 113000331212111222200201 |
5 | 101231402020033020001 |
6 | 555140214341231041 |
7 | 30214663655220655 |
oct | 2700754625524041 |
9 | 437348566606887 |
10 | 101221211220001 |
11 | 2a2857469a1854 |
12 | b429422a02481 |
13 | 446317202a9b2 |
14 | 1add1c0432a65 |
15 | ba7ee172b1a1 |
hex | 5c0f6656a821 |
101221211220001 has 4 divisors (see below), whose sum is σ = 101223770517504. Its totient is φ = 101218651922500.
The previous prime is 101221211219959. The next prime is 101221211220013. The reversal of 101221211220001 is 100022112122101.
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 not a de Polignac number, because 101221211220001 - 223 = 101221202831393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101221211220091) 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, 1279589425 + ... + 1279668526.
It is an arithmetic number, because the mean of its divisors is an integer number (25305942629376).
Almost surely, 2101221211220001 is an apocalyptic number.
It is an amenable number.
101221211220001 is a deficient number, since it is larger than the sum of its proper divisors (2559297503).
101221211220001 is an equidigital number, since it uses as much as digits as its factorization.
101221211220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2559297502.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101221211220001 its reverse (100022112122101), we get a palindrome (201243323342102).
The spelling of 101221211220001 in words is "one hundred one trillion, two hundred twenty-one billion, two hundred eleven million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •