Base | Representation |
---|---|
bin | 101111100101110100… |
… | …1111101001100100111 |
3 | 100202210120020210202021 |
4 | 1133023221331030213 |
5 | 3133301430134343 |
6 | 114541150324011 |
7 | 10245431230000 |
oct | 1371351751447 |
9 | 322716223667 |
10 | 102201021223 |
11 | 3a3858a2a04 |
12 | 17982ab9607 |
13 | 983980ab72 |
14 | 4d374c61a7 |
15 | 29d25a90ed |
hex | 17cba7d327 |
102201021223 has 20 divisors (see below), whose sum is σ = 125502614360. Its totient is φ = 82990265904.
The previous prime is 102201021191. The next prime is 102201021269. The reversal of 102201021223 is 322120102201.
It is a happy number.
It is not a de Polignac number, because 102201021223 - 25 = 102201021191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102201021197 and 102201021206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102201021623) by changing a digit.
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 19 ways as a sum of consecutive naturals, for example, 1074540 + ... + 1165777.
It is an arithmetic number, because the mean of its divisors is an integer number (6275130718).
Almost surely, 2102201021223 is an apocalyptic number.
102201021223 is a deficient number, since it is larger than the sum of its proper divisors (23301593137).
102201021223 is an frugal number, since it uses more digits than its factorization.
102201021223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2240364 (or 2240343 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 102201021223 its reverse (322120102201), we get a palindrome (424321123424).
The spelling of 102201021223 in words is "one hundred two billion, two hundred one million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •