Base | Representation |
---|---|
bin | 111101011001100… |
… | …110101011101111 |
3 | 2122210100122000221 |
4 | 331121212223233 |
5 | 4102202402343 |
6 | 250115032211 |
7 | 34345615534 |
oct | 7531465357 |
9 | 2583318027 |
10 | 1030122223 |
11 | 489528089 |
12 | 248b9b667 |
13 | 1355559a0 |
14 | 9ab4cd8b |
15 | 606815ed |
hex | 3d666aef |
1030122223 has 16 divisors (see below), whose sum is σ = 1128254400. Its totient is φ = 934813440.
The previous prime is 1030122211. The next prime is 1030122239. The reversal of 1030122223 is 3222210301.
It is a cyclic number.
It is not a de Polignac number, because 1030122223 - 29 = 1030121711 is a prime.
It is a super-2 number, since 2×10301222232 = 2122303588636923458, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1030122197 and 1030122206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030122263) 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, 206958 + ... + 211876.
It is an arithmetic number, because the mean of its divisors is an integer number (70515900).
Almost surely, 21030122223 is an apocalyptic number.
1030122223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1030122223 is a deficient number, since it is larger than the sum of its proper divisors (98132177).
1030122223 is a wasteful number, since it uses less digits than its factorization.
1030122223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5202.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 1030122223 is about 32095.5171791950. The cubic root of 1030122223 is about 1009.9415784918.
Adding to 1030122223 its reverse (3222210301), we get a palindrome (4252332524).
The spelling of 1030122223 in words is "one billion, thirty million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •