Base | Representation |
---|---|
bin | 101111100011011010… |
… | …1010100000001011101 |
3 | 100202120221000012110120 |
4 | 1133012311110001131 |
5 | 3133120222042341 |
6 | 114525140225153 |
7 | 10243426426461 |
oct | 1370665240135 |
9 | 322527005416 |
10 | 102120112221 |
11 | 3a344160866 |
12 | 1795b99b1b9 |
13 | 9825b1cb0a |
14 | 4d2a8644a1 |
15 | 29ca426066 |
hex | 17c6d5405d |
102120112221 has 8 divisors (see below), whose sum is σ = 139840153824. Its totient is φ = 66240072720.
The previous prime is 102120112219. The next prime is 102120112279. The reversal of 102120112221 is 122211021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102120112221 - 21 = 102120112219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102120112221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120112201) 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 7 ways as a sum of consecutive naturals, for example, 460000395 + ... + 460000616.
It is an arithmetic number, because the mean of its divisors is an integer number (17480019228).
Almost surely, 2102120112221 is an apocalyptic number.
It is an amenable number.
102120112221 is a deficient number, since it is larger than the sum of its proper divisors (37720041603).
102120112221 is an equidigital number, since it uses as much as digits as its factorization.
102120112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 920001051.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102120112221 its reverse (122211021201), we get a palindrome (224331133422).
The spelling of 102120112221 in words is "one hundred two billion, one hundred twenty million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •