Base | Representation |
---|---|
bin | 10111001101111100010110… |
… | …011100011101000100001000 |
3 | 111101112221002011010112221121 |
4 | 113031330112130131010020 |
5 | 101341010340322121412 |
6 | 1001102100103245024 |
7 | 30336302612012545 |
oct | 2715742634350410 |
9 | 441487064115847 |
10 | 102113224020232 |
11 | 2a599a7a9671a7 |
12 | b552288149774 |
13 | 44c930ab05c99 |
14 | 1b30440b23bcc |
15 | bc12ec93a107 |
hex | 5cdf1671d108 |
102113224020232 has 32 divisors (see below), whose sum is σ = 199830337303680. Its totient is φ = 48826102842880.
The previous prime is 102113224020193. The next prime is 102113224020293. The reversal of 102113224020232 is 232020422311201.
It is a super-2 number, since 2×1021132240202322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102113224020197 and 102113224020206.
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 7 ways as a sum of consecutive naturals, for example, 59702569 + ... + 61389112.
It is an arithmetic number, because the mean of its divisors is an integer number (6244698040740).
Almost surely, 2102113224020232 is an apocalyptic number.
It is an amenable number.
102113224020232 is a deficient number, since it is larger than the sum of its proper divisors (97717113283448).
102113224020232 is a wasteful number, since it uses less digits than its factorization.
102113224020232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121096293 (or 121096289 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 102113224020232 its reverse (232020422311201), we get a palindrome (334133646331433).
The spelling of 102113224020232 in words is "one hundred two trillion, one hundred thirteen billion, two hundred twenty-four million, twenty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •