Base | Representation |
---|---|
bin | 11101111110101110110… |
… | …10011000100000010101 |
3 | 10122110220012221221100212 |
4 | 32333113122120200111 |
5 | 113334131431420201 |
6 | 2105120534015205 |
7 | 134265054511640 |
oct | 16772732304025 |
9 | 3573805857325 |
10 | 1030111201301 |
11 | 36795aa11126 |
12 | 1477861a7505 |
13 | 761a66c6a10 |
14 | 37c0155aa57 |
15 | 1bbe0008abb |
hex | efd7698815 |
1030111201301 has 8 divisors (see below), whose sum is σ = 1267829170944. Its totient is φ = 815033038320.
The previous prime is 1030111201279. The next prime is 1030111201309. The reversal of 1030111201301 is 1031021110301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030111201301 - 238 = 755233294357 is a prime.
It is a super-2 number, since 2×10301112013012 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030111201309) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5659951565 + ... + 5659951746.
It is an arithmetic number, because the mean of its divisors is an integer number (158478646368).
Almost surely, 21030111201301 is an apocalyptic number.
It is an amenable number.
1030111201301 is a deficient number, since it is larger than the sum of its proper divisors (237717969643).
1030111201301 is a wasteful number, since it uses less digits than its factorization.
1030111201301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11319903331.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1030111201301 its reverse (1031021110301), we get a palindrome (2061132311602).
The spelling of 1030111201301 in words is "one trillion, thirty billion, one hundred eleven million, two hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •