Base | Representation |
---|---|
bin | 11101111110111100001… |
… | …01001111110100100101 |
3 | 10122111012000112001012100 |
4 | 32333132011033310211 |
5 | 113334344103214341 |
6 | 2105140012242313 |
7 | 134300613605526 |
oct | 16773605176445 |
9 | 3574160461170 |
10 | 1030223101221 |
11 | 367a080a01a6 |
12 | 1477b7770399 |
13 | 761c3945aa2 |
14 | 37c1236884d |
15 | 1bbe9c5e3b6 |
hex | efde14fd25 |
1030223101221 has 24 divisors (see below), whose sum is σ = 1500626376704. Its totient is φ = 681039848160.
The previous prime is 1030223101183. The next prime is 1030223101301. The reversal of 1030223101221 is 1221013220301.
1030223101221 is a `hidden beast` number, since 10 + 302 + 231 + 0 + 122 + 1 = 666.
It is not a de Polignac number, because 1030223101221 - 26 = 1030223101157 is a prime.
It is a super-2 number, since 2×10302231012212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1030223101194 and 1030223101203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030223101421) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1884960 + ... + 2369286.
Almost surely, 21030223101221 is an apocalyptic number.
It is an amenable number.
1030223101221 is a deficient number, since it is larger than the sum of its proper divisors (470403275483).
1030223101221 is a wasteful number, since it uses less digits than its factorization.
1030223101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486321 (or 486318 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1030223101221 its reverse (1221013220301), we get a palindrome (2251236321522).
The spelling of 1030223101221 in words is "one trillion, thirty billion, two hundred twenty-three million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •