Base | Representation |
---|---|
bin | 1001001100101010100111… |
… | …1101100011011101101111 |
3 | 1022210210221121110201021001 |
4 | 2103022221331203131233 |
5 | 2311143320323002320 |
6 | 33301535250221131 |
7 | 2062440430620316 |
oct | 223125175433557 |
9 | 38723847421231 |
10 | 10113204500335 |
11 | 3249a93320712 |
12 | 117400b8847a7 |
13 | 58489550b471 |
14 | 26d6a5b4d27d |
15 | 12810352720a |
hex | 932a9f6376f |
10113204500335 has 4 divisors (see below), whose sum is σ = 12135845400408. Its totient is φ = 8090563600264.
The previous prime is 10113204500261. The next prime is 10113204500369. The reversal of 10113204500335 is 53300540231101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10113204500335 - 227 = 10113070282607 is a prime.
It is a super-4 number, since 4×101132045003354 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1011320450029 + ... + 1011320450038.
It is an arithmetic number, because the mean of its divisors is an integer number (3033961350102).
Almost surely, 210113204500335 is an apocalyptic number.
10113204500335 is a deficient number, since it is larger than the sum of its proper divisors (2022640900073).
10113204500335 is an equidigital number, since it uses as much as digits as its factorization.
10113204500335 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2022640900072.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 10113204500335 its reverse (53300540231101), we get a palindrome (63413744731436).
The spelling of 10113204500335 in words is "ten trillion, one hundred thirteen billion, two hundred four million, five hundred thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •