Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …11110111101000010001 |
3 | 10122110212122220112211100 |
4 | 32333112323313220101 |
5 | 113334122404433241 |
6 | 2105120050335013 |
7 | 134264626515204 |
oct | 16772673675021 |
9 | 3573778815740 |
10 | 1030103202321 |
11 | 3679564483a6 |
12 | 14778358a469 |
13 | 761a4b55bab |
14 | 37c0047793b |
15 | 1bbde4789b6 |
hex | efd6ef7a11 |
1030103202321 has 12 divisors (see below), whose sum is σ = 1487935780240. Its totient is φ = 686731345560.
The previous prime is 1030103202313. The next prime is 1030103202341. The reversal of 1030103202321 is 1232023010301.
1030103202321 is a `hidden beast` number, since 1 + 0 + 301 + 0 + 320 + 23 + 21 = 666.
It is not a de Polignac number, because 1030103202321 - 23 = 1030103202313 is a prime.
It is a super-2 number, since 2×10301032023212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1030103202294 and 1030103202303.
It is not an unprimeable number, because it can be changed into a prime (1030103202301) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2352270 + ... + 2755608.
Almost surely, 21030103202321 is an apocalyptic number.
It is an amenable number.
1030103202321 is a deficient number, since it is larger than the sum of its proper divisors (457832577919).
1030103202321 is a wasteful number, since it uses less digits than its factorization.
1030103202321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 687116 (or 687113 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1030103202321 its reverse (1232023010301), we get a palindrome (2262126212622).
The spelling of 1030103202321 in words is "one trillion, thirty billion, one hundred three million, two hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •