Base | Representation |
---|---|
bin | 10111001100011110000110… |
… | …111111101110110110100110 |
3 | 111101012020212222120020221102 |
4 | 113030132012333232312212 |
5 | 101332331120433214342 |
6 | 1000543403034520102 |
7 | 30326061164260136 |
oct | 2714360677566646 |
9 | 441166788506842 |
10 | 102012033101222 |
11 | 2a560073268012 |
12 | b536747596032 |
13 | 44bc90266154a |
14 | 1b295a1858ac6 |
15 | bbd878daa832 |
hex | 5cc786feeda6 |
102012033101222 has 4 divisors (see below), whose sum is σ = 153018049651836. Its totient is φ = 51006016550610.
The previous prime is 102012033101221. The next prime is 102012033101267. The reversal of 102012033101222 is 222101330210201.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 102012033101194 and 102012033101203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102012033101221) 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 as a sum of consecutive naturals, namely, 25503008275304 + ... + 25503008275307.
It is an arithmetic number, because the mean of its divisors is an integer number (38254512412959).
Almost surely, 2102012033101222 is an apocalyptic number.
102012033101222 is a deficient number, since it is larger than the sum of its proper divisors (51006016550614).
102012033101222 is an equidigital number, since it uses as much as digits as its factorization.
102012033101222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51006016550613.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 102012033101222 its reverse (222101330210201), we get a palindrome (324113363311423).
The spelling of 102012033101222 in words is "one hundred two trillion, twelve billion, thirty-three million, one hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •