Base | Representation |
---|---|
bin | 1001001100100110010000… |
… | …0110000010101011011111 |
3 | 1022210200220220210210102211 |
4 | 2103021210012002223133 |
5 | 2311133420233221343 |
6 | 33301223054301251 |
7 | 2062366405350511 |
oct | 223114406025337 |
9 | 38720826723384 |
10 | 10112032320223 |
11 | 3249541696419 |
12 | 11739431b7827 |
13 | 584739707872 |
14 | 26d5d41c1bb1 |
15 | 12808568479d |
hex | 93264182adf |
10112032320223 has 4 divisors (see below), whose sum is σ = 10277803341928. Its totient is φ = 9946261298520.
The previous prime is 10112032320211. The next prime is 10112032320293. The reversal of 10112032320223 is 32202323021101.
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 10112032320223 - 25 = 10112032320191 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10112032320194 and 10112032320203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112032320293) 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, 82885510761 + ... + 82885510882.
It is an arithmetic number, because the mean of its divisors is an integer number (2569450835482).
Almost surely, 210112032320223 is an apocalyptic number.
10112032320223 is a deficient number, since it is larger than the sum of its proper divisors (165771021705).
10112032320223 is an equidigital number, since it uses as much as digits as its factorization.
10112032320223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165771021704.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10112032320223 its reverse (32202323021101), we get a palindrome (42314355341324).
The spelling of 10112032320223 in words is "ten trillion, one hundred twelve billion, thirty-two million, three hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •