Base | Representation |
---|---|
bin | 101111011111111000… |
… | …0001010100011101111 |
3 | 100202021122111001020000 |
4 | 1132333300022203233 |
5 | 3132344314302343 |
6 | 114505254155343 |
7 | 10240454635113 |
oct | 1367760124357 |
9 | 322248431200 |
10 | 102001322223 |
11 | 3a2930a6109 |
12 | 17928052b53 |
13 | 980732a888 |
14 | 4d18b81743 |
15 | 29becaded3 |
hex | 17bfc0a8ef |
102001322223 has 40 divisors (see below), whose sum is σ = 158731013760. Its totient is φ = 65203392960.
The previous prime is 102001322221. The next prime is 102001322249. The reversal of 102001322223 is 322223100201.
It is not a de Polignac number, because 102001322223 - 21 = 102001322221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102001322196 and 102001322205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102001322221) 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 39 ways as a sum of consecutive naturals, for example, 87361 + ... + 460037.
It is an arithmetic number, because the mean of its divisors is an integer number (3968275344).
Almost surely, 2102001322223 is an apocalyptic number.
102001322223 is a deficient number, since it is larger than the sum of its proper divisors (56729691537).
102001322223 is a wasteful number, since it uses less digits than its factorization.
102001322223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372829 (or 372820 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 102001322223 its reverse (322223100201), we get a palindrome (424224422424).
The spelling of 102001322223 in words is "one hundred two billion, one million, three hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •