Base | Representation |
---|---|
bin | 10110111111100000010010… |
… | …100011001001110001110010 |
3 | 111021001002000211112000111022 |
4 | 112333200102203021301302 |
5 | 101223231322413101002 |
6 | 555022204510015442 |
7 | 30204516113253305 |
oct | 2677402243116162 |
9 | 437032024460438 |
10 | 101121021222002 |
11 | 2a247203295411 |
12 | b411b214a7582 |
13 | 4456896056702 |
14 | 1ad83d8074b3c |
15 | ba55ca9b0ba2 |
hex | 5bf8128c9c72 |
101121021222002 has 8 divisors (see below), whose sum is σ = 153245258965596. Its totient is φ = 50039268233472.
The previous prime is 101121021221981. The next prime is 101121021222007. The reversal of 101121021222002 is 200222120121101.
It can be written as a sum of positive squares in 2 ways, for example, as 100055627733961 + 1065393488041 = 10002781^2 + 1032179^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not an unprimeable number, because it can be changed into a prime (101121021222007) 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 3 ways as a sum of consecutive naturals, for example, 260621188523 + ... + 260621188910.
Almost surely, 2101121021222002 is an apocalyptic number.
101121021222002 is a deficient number, since it is larger than the sum of its proper divisors (52124237743594).
101121021222002 is an equidigital number, since it uses as much as digits as its factorization.
101121021222002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521242377532.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101121021222002 its reverse (200222120121101), we get a palindrome (301343141343103).
The spelling of 101121021222002 in words is "one hundred one trillion, one hundred twenty-one billion, twenty-one million, two hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •