Base | Representation |
---|---|
bin | 10111001100110001000110… |
… | …001001101010011111001111 |
3 | 111101021012111210011011000121 |
4 | 113030301012021222133033 |
5 | 101333144344011202343 |
6 | 1001001014025205411 |
7 | 30330412325243455 |
oct | 2714610611523717 |
9 | 441235453134017 |
10 | 102032420022223 |
11 | 2a568785139559 |
12 | b53a697030867 |
13 | 44c180124b602 |
14 | 1b2a57729c9d5 |
15 | bbe16daa4aed |
hex | 5ccc4626a7cf |
102032420022223 has 16 divisors (see below), whose sum is σ = 104554116817920. Its totient is φ = 99517498841376.
The previous prime is 102032420022187. The next prime is 102032420022241. The reversal of 102032420022223 is 322220024230201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102032420022223 is a prime.
It is a super-2 number, since 2×1020324200222232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102032420022523) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1736485761 + ... + 1736544517.
It is an arithmetic number, because the mean of its divisors is an integer number (6534632301120).
Almost surely, 2102032420022223 is an apocalyptic number.
102032420022223 is a deficient number, since it is larger than the sum of its proper divisors (2521696795697).
102032420022223 is an equidigital number, since it uses as much as digits as its factorization.
102032420022223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115686.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 102032420022223 its reverse (322220024230201), we get a palindrome (424252444252424).
The spelling of 102032420022223 in words is "one hundred two trillion, thirty-two billion, four hundred twenty million, twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •