Base | Representation |
---|---|
bin | 10111001100011101011011… |
… | …010100000011001110000110 |
3 | 111101012011222220112112122122 |
4 | 113030131123110003032012 |
5 | 101332323120324330042 |
6 | 1000543202214525542 |
7 | 30326034055051331 |
oct | 2714353324031606 |
9 | 441164886475578 |
10 | 102011300230022 |
11 | 2a55a827607037 |
12 | b5365820668b2 |
13 | 44bc816883351 |
14 | 1b295323a5618 |
15 | bbd8348937d2 |
hex | 5cc75b503386 |
102011300230022 has 8 divisors (see below), whose sum is σ = 155904062615856. Its totient is φ = 50043279358072.
The previous prime is 102011300230019. The next prime is 102011300230067. The reversal of 102011300230022 is 220032003110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1020113002300222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 481185378338 + ... + 481185378549.
It is an arithmetic number, because the mean of its divisors is an integer number (19488007826982).
Almost surely, 2102011300230022 is an apocalyptic number.
102011300230022 is a deficient number, since it is larger than the sum of its proper divisors (53892762385834).
102011300230022 is an equidigital number, since it uses as much as digits as its factorization.
102011300230022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 962370756942.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 102011300230022 its reverse (220032003110201), we get a palindrome (322043303340223).
The spelling of 102011300230022 in words is "one hundred two trillion, eleven billion, three hundred million, two hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •