Base | Representation |
---|---|
bin | 10111001111011000011011… |
… | …111110001111111000001011 |
3 | 111101220101022001122012212222 |
4 | 113033120123332033320023 |
5 | 101344120340324404003 |
6 | 1001215331352324255 |
7 | 30346403101412522 |
oct | 2717303376177013 |
9 | 441811261565788 |
10 | 102212101013003 |
11 | 2a6279aa3a3353 |
12 | b5694819a368b |
13 | 4505737a6a8b7 |
14 | 1b351409774b9 |
15 | bc3b88296c38 |
hex | 5cf61bf8fe0b |
102212101013003 has 8 divisors (see below), whose sum is σ = 103194733287360. Its totient is φ = 101230285222080.
The previous prime is 102212101012993. The next prime is 102212101013027. The reversal of 102212101013003 is 300310101212201.
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 102212101013003 - 232 = 102207806045707 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102212101013303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203869283 + ... + 204370028.
It is an arithmetic number, because the mean of its divisors is an integer number (12899341660920).
Almost surely, 2102212101013003 is an apocalyptic number.
102212101013003 is a deficient number, since it is larger than the sum of its proper divisors (982632274357).
102212101013003 is a wasteful number, since it uses less digits than its factorization.
102212101013003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408241717.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 102212101013003 its reverse (300310101212201), we get a palindrome (402522202225204).
The spelling of 102212101013003 in words is "one hundred two trillion, two hundred twelve billion, one hundred one million, thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •