Base | Representation |
---|---|
bin | 1001001101101001001110… |
… | …1110100001111001111111 |
3 | 1022212102022220111020100011 |
4 | 2103122103232201321333 |
5 | 2311432230400112343 |
6 | 33313355111044051 |
7 | 2063604060420226 |
oct | 223322356417177 |
9 | 38772286436304 |
10 | 10130011332223 |
11 | 3256128343222 |
12 | 1177320370627 |
13 | 58634349a0c3 |
14 | 27041bd07cbd |
15 | 128788c9429d |
hex | 93693ba1e7f |
10130011332223 has 4 divisors (see below), whose sum is σ = 10130270842368. Its totient is φ = 10129751822080.
The previous prime is 10130011332143. The next prime is 10130011332229. The reversal of 10130011332223 is 32223311003101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10130011332223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10130011332194 and 10130011332203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130011332229) 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, 129696511 + ... + 129774592.
It is an arithmetic number, because the mean of its divisors is an integer number (2532567710592).
Almost surely, 210130011332223 is an apocalyptic number.
10130011332223 is a deficient number, since it is larger than the sum of its proper divisors (259510145).
10130011332223 is an equidigital number, since it uses as much as digits as its factorization.
10130011332223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 259510144.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 10130011332223 its reverse (32223311003101), we get a palindrome (42353322335324).
The spelling of 10130011332223 in words is "ten trillion, one hundred thirty billion, eleven million, three hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •