Base | Representation |
---|---|
bin | 10111001101110001001011… |
… | …000101100100000010010000 |
3 | 111101111210002201210111122102 |
4 | 113031301023011210002100 |
5 | 101340311300402410112 |
6 | 1001052353133055532 |
7 | 30335366320114031 |
oct | 2715611305440220 |
9 | 441453081714572 |
10 | 102101222310032 |
11 | 2a594981247740 |
12 | b54ba989275a8 |
13 | 44c81474c2c0a |
14 | 1b2da22bbca88 |
15 | bc0d48e7cbc2 |
hex | 5cdc4b164090 |
102101222310032 has 20 divisors (see below), whose sum is σ = 215804856246576. Its totient is φ = 46409646504480.
The previous prime is 102101222310013. The next prime is 102101222310037. The reversal of 102101222310032 is 230013222101201.
It is a junction number, because it is equal to n+sod(n) for n = 102101222309986 and 102101222310013.
It is not an unprimeable number, because it can be changed into a prime (102101222310037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 290060290478 + ... + 290060290829.
Almost surely, 2102101222310032 is an apocalyptic number.
It is an amenable number.
102101222310032 is an abundant number, since it is smaller than the sum of its proper divisors (113703633936544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102101222310032 is a wasteful number, since it uses less digits than its factorization.
102101222310032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580120581326 (or 580120581320 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 102101222310032 its reverse (230013222101201), we get a palindrome (332114444411233).
The spelling of 102101222310032 in words is "one hundred two trillion, one hundred one billion, two hundred twenty-two million, three hundred ten thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •