Base | Representation |
---|---|
bin | 10111001111100001000000… |
… | …010101110111110001111001 |
3 | 111101221021001020021002021001 |
4 | 113033201000111313301321 |
5 | 101344243211041320441 |
6 | 1001223452322445001 |
7 | 30350150064135331 |
oct | 2717410025676171 |
9 | 441837036232231 |
10 | 102221301120121 |
11 | 2a6308a063aa67 |
12 | b56b20ab03761 |
13 | 4506572b11b71 |
14 | 1b3577479c0c1 |
15 | bc4025cee731 |
hex | 5cf840577c79 |
102221301120121 has 8 divisors (see below), whose sum is σ = 106934384885184. Its totient is φ = 97530607302480.
The previous prime is 102221301120097. The next prime is 102221301120131. The reversal of 102221301120121 is 121021103122201.
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 102221301120121 - 223 = 102221292731513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102221301120131) 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, 5597477515 + ... + 5597495776.
It is an arithmetic number, because the mean of its divisors is an integer number (13366798110648).
Almost surely, 2102221301120121 is an apocalyptic number.
It is an amenable number.
102221301120121 is a deficient number, since it is larger than the sum of its proper divisors (4713083765063).
102221301120121 is a wasteful number, since it uses less digits than its factorization.
102221301120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11194973711.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 102221301120121 its reverse (121021103122201), we get a palindrome (223242404242322).
The spelling of 102221301120121 in words is "one hundred two trillion, two hundred twenty-one billion, three hundred one million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •