Base | Representation |
---|---|
bin | 10111001101110001001011… |
… | …000001010101010100111001 |
3 | 111101111210002122201011121220 |
4 | 113031301023001111110321 |
5 | 101340311300111414314 |
6 | 1001052353053222253 |
7 | 30335366304515226 |
oct | 2715611301252471 |
9 | 441453078634556 |
10 | 102101221201209 |
11 | 2a59498065a65a |
12 | b54ba98491989 |
13 | 44c81471c52c9 |
14 | 1b2da229b094d |
15 | bc0d48d0e3a9 |
hex | 5cdc4b055539 |
102101221201209 has 4 divisors (see below), whose sum is σ = 136134961601616. Its totient is φ = 68067480800804.
The previous prime is 102101221201207. The next prime is 102101221201249. The reversal of 102101221201209 is 902102122101201.
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 102101221201209 - 21 = 102101221201207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102101221201207) 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, 17016870200199 + ... + 17016870200204.
It is an arithmetic number, because the mean of its divisors is an integer number (34033740400404).
Almost surely, 2102101221201209 is an apocalyptic number.
It is an amenable number.
102101221201209 is a deficient number, since it is larger than the sum of its proper divisors (34033740400407).
102101221201209 is an equidigital number, since it uses as much as digits as its factorization.
102101221201209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34033740400406.
The product of its (nonzero) digits is 288, while the sum is 24.
The spelling of 102101221201209 in words is "one hundred two trillion, one hundred one billion, two hundred twenty-one million, two hundred one thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •