Base | Representation |
---|---|
bin | 10110111111100000011110… |
… | …011001011110000000010010 |
3 | 111021001002112200120111100211 |
4 | 112333200132121132000102 |
5 | 101223232224310310002 |
6 | 555022240330434334 |
7 | 30204524046032203 |
oct | 2677403631360022 |
9 | 437032480514324 |
10 | 101121220010002 |
11 | 2a2472a551a815 |
12 | b411b77b929aa |
13 | 44568c82a814a |
14 | 1ad841661d5aa |
15 | ba55dd17add7 |
hex | 5bf81e65e012 |
101121220010002 has 4 divisors (see below), whose sum is σ = 151681830015006. Its totient is φ = 50560610005000.
The previous prime is 101121220009993. The next prime is 101121220010003. The reversal of 101121220010002 is 200010022121101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 99273145615281 + 1848074394721 = 9963591^2 + 1359439^2 .
It is a super-2 number, since 2×1011212200100022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101121220010003) 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 as a sum of consecutive naturals, namely, 25280305002499 + ... + 25280305002502.
Almost surely, 2101121220010002 is an apocalyptic number.
101121220010002 is a deficient number, since it is larger than the sum of its proper divisors (50560610005004).
101121220010002 is an equidigital number, since it uses as much as digits as its factorization.
101121220010002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50560610005003.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101121220010002 its reverse (200010022121101), we get a palindrome (301131242131103).
The spelling of 101121220010002 in words is "one hundred one trillion, one hundred twenty-one billion, two hundred twenty million, ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •