Base | Representation |
---|---|
bin | 1001001100101001111100… |
… | …1001111101011100100111 |
3 | 1022210210110222022212020001 |
4 | 2103022133021331130213 |
5 | 2311142432414444421 |
6 | 33301505252322131 |
7 | 2062433066620063 |
oct | 223123711753447 |
9 | 38723428285201 |
10 | 10113023203111 |
11 | 32499aaa523a4 |
12 | 1173b7b013347 |
13 | 584866aa1cba |
14 | 26d689a38aa3 |
15 | 1280e2664691 |
hex | 9329f27d727 |
10113023203111 has 8 divisors (see below), whose sum is σ = 10164516961104. Its totient is φ = 10061531047680.
The previous prime is 10113023203061. The next prime is 10113023203219. The reversal of 10113023203111 is 11130232031101.
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 10113023203111 - 29 = 10113023202599 is a prime.
It is a super-2 number, since 2×101130232031112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113023203411) 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, 13472056 + ... + 14202898.
It is an arithmetic number, because the mean of its divisors is an integer number (1270564620138).
Almost surely, 210113023203111 is an apocalyptic number.
10113023203111 is a deficient number, since it is larger than the sum of its proper divisors (51493757993).
10113023203111 is an equidigital number, since it uses as much as digits as its factorization.
10113023203111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801281.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10113023203111 its reverse (11130232031101), we get a palindrome (21243255234212).
The spelling of 10113023203111 in words is "ten trillion, one hundred thirteen billion, twenty-three million, two hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •