Base | Representation |
---|---|
bin | 10111001111100001110001… |
… | …001010100010010011000011 |
3 | 111101221100011022120021200220 |
4 | 113033201301022202103003 |
5 | 101344301400234412011 |
6 | 1001224105503114123 |
7 | 30350206301362104 |
oct | 2717416112422303 |
9 | 441840138507626 |
10 | 102222120232131 |
11 | 2a631180a44a39 |
12 | b56b3b92a2943 |
13 | 4506673726c23 |
14 | 1b358114a03ab |
15 | bc4072b9e506 |
hex | 5cf8712a24c3 |
102222120232131 has 8 divisors (see below), whose sum is σ = 136707931187904. Its totient is φ = 67942194715560.
The previous prime is 102222120232123. The next prime is 102222120232147. The reversal of 102222120232131 is 131232021222201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102222120232131 - 23 = 102222120232123 is a prime.
It is a super-2 number, since 2×1022221202321312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102222120232151) 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, 51471358641 + ... + 51471360626.
It is an arithmetic number, because the mean of its divisors is an integer number (17088491398488).
Almost surely, 2102222120232131 is an apocalyptic number.
102222120232131 is a deficient number, since it is larger than the sum of its proper divisors (34485810955773).
102222120232131 is a wasteful number, since it uses less digits than its factorization.
102222120232131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102942719601.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 102222120232131 its reverse (131232021222201), we get a palindrome (233454141454332).
The spelling of 102222120232131 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred twenty million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •