Base | Representation |
---|---|
bin | 10111001100100111100101… |
… | …101001010101111100000000 |
3 | 111101020020011022002012012122 |
4 | 113030213211221111330000 |
5 | 101333012442004031422 |
6 | 1000552205014343412 |
7 | 30326601332065442 |
oct | 2714474551257400 |
9 | 441206138065178 |
10 | 102022211002112 |
11 | 2a564416440655 |
12 | b53870805ab68 |
13 | 44c08651692cb |
14 | 1b29c8948a492 |
15 | bbdc726a9d42 |
hex | 5cc9e5a55f00 |
102022211002112 has 36 divisors (see below), whose sum is σ = 215625068207136. Its totient is φ = 48010452234240.
The previous prime is 102022211002109. The next prime is 102022211002219. The reversal of 102022211002112 is 211200112220201.
It is a Harshad number since it is a multiple of its sum of digits (17).
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, 11721297464 + ... + 11721306167.
It is an arithmetic number, because the mean of its divisors is an integer number (5989585227976).
Almost surely, 2102022211002112 is an apocalyptic number.
It is an amenable number.
102022211002112 is an abundant number, since it is smaller than the sum of its proper divisors (113602857205024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102022211002112 is an equidigital number, since it uses as much as digits as its factorization.
102022211002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23442603664 (or 23442603650 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102022211002112 its reverse (211200112220201), we get a palindrome (313222323222313).
The spelling of 102022211002112 in words is "one hundred two trillion, twenty-two billion, two hundred eleven million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •