Base | Representation |
---|---|
bin | 10111001111011111110011… |
… | …100001001001011010111100 |
3 | 111101221010201101222200212012 |
4 | 113033133303201021122330 |
5 | 101344233041112332312 |
6 | 1001223120401230352 |
7 | 30350103123560213 |
oct | 2717376341113274 |
9 | 441833641880765 |
10 | 102220012230332 |
11 | 2a63029a040a97 |
12 | b56ab0b3323b8 |
13 | 45063c8a96b99 |
14 | 1b3569153007a |
15 | bc3e9caa6322 |
hex | 5cf7f38496bc |
102220012230332 has 24 divisors (see below), whose sum is σ = 182272207824000. Its totient is φ = 50142365522496.
The previous prime is 102220012230331. The next prime is 102220012230359. The reversal of 102220012230332 is 233032210022201.
It is a super-2 number, since 2×1022200122303322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102220012230298 and 102220012230307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102220012230331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12639707 + ... + 19084082.
It is an arithmetic number, because the mean of its divisors is an integer number (7594675326000).
Almost surely, 2102220012230332 is an apocalyptic number.
It is an amenable number.
102220012230332 is a deficient number, since it is larger than the sum of its proper divisors (80052195593668).
102220012230332 is a wasteful number, since it uses less digits than its factorization.
102220012230332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31739045 (or 31739043 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 102220012230332 its reverse (233032210022201), we get a palindrome (335252222252533).
The spelling of 102220012230332 in words is "one hundred two trillion, two hundred twenty billion, twelve million, two hundred thirty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •