Base | Representation |
---|---|
bin | 1001001100000101000001… |
… | …1110010110000001100001 |
3 | 1022202211220022221011002021 |
4 | 2103001100132112001201 |
5 | 2311012133440241001 |
6 | 33253150043021441 |
7 | 2061632364235525 |
oct | 223012036260141 |
9 | 38684808834067 |
10 | 10103113212001 |
11 | 32457850253a7 |
12 | 117207420a881 |
13 | 58394793a834 |
14 | 26cdc9825d85 |
15 | 127c12635ba1 |
hex | 93050796061 |
10103113212001 has 4 divisors (see below), whose sum is σ = 10111525464004. Its totient is φ = 10094700960000.
The previous prime is 10103113211959. The next prime is 10103113212013. The reversal of 10103113212001 is 10021231130101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 772287682401 + 9330825529600 = 878799^2 + 3054640^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103113212001 - 229 = 10102576341089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10103113212601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4206124200 + ... + 4206126601.
It is an arithmetic number, because the mean of its divisors is an integer number (2527881366001).
Almost surely, 210103113212001 is an apocalyptic number.
It is an amenable number.
10103113212001 is a deficient number, since it is larger than the sum of its proper divisors (8412252003).
10103113212001 is an equidigital number, since it uses as much as digits as its factorization.
10103113212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8412252002.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10103113212001 its reverse (10021231130101), we get a palindrome (20124344342102).
The spelling of 10103113212001 in words is "ten trillion, one hundred three billion, one hundred thirteen million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •