Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …11001000111110000001 |
3 | 10122110212122112211122211 |
4 | 32333112323020332001 |
5 | 113334122332324301 |
6 | 2105120042302121 |
7 | 134264625061045 |
oct | 16772673107601 |
9 | 3573778484584 |
10 | 1030103011201 |
11 | 367956327850 |
12 | 1477834b7941 |
13 | 761a4ab9bc4 |
14 | 37c00428025 |
15 | 1bbde43c051 |
hex | efd6ec8f81 |
1030103011201 has 8 divisors (see below), whose sum is σ = 1123757373024. Its totient is φ = 936450088320.
The previous prime is 1030103011129. The next prime is 1030103011207. The reversal of 1030103011201 is 1021103010301.
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 1030103011201 - 213 = 1030103003009 is a prime.
It is a super-2 number, since 2×10301030112012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1030103011207) 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, 1602481 + ... + 2151313.
It is an arithmetic number, because the mean of its divisors is an integer number (140469671628).
Almost surely, 21030103011201 is an apocalyptic number.
1030103011201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1030103011201 is a deficient number, since it is larger than the sum of its proper divisors (93654361823).
1030103011201 is a wasteful number, since it uses less digits than its factorization.
1030103011201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 719471.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 1030103011201 its reverse (1021103010301), we get a palindrome (2051206021502).
The spelling of 1030103011201 in words is "one trillion, thirty billion, one hundred three million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •