Base | Representation |
---|---|
bin | 10000011100101011001… |
… | …000010100111110101111 |
3 | 11000001111112212100210022 |
4 | 100130223020110332233 |
5 | 122004323300032343 |
6 | 2223130323432355 |
7 | 144442613332310 |
oct | 20345310247657 |
9 | 4001445770708 |
10 | 1130300002223 |
11 | 3a63a2980147 |
12 | 1630872256bb |
13 | 8278236c182 |
14 | 3c9c76c6607 |
15 | 1e605ad9568 |
hex | 1072b214faf |
1130300002223 has 8 divisors (see below), whose sum is σ = 1297131480480. Its totient is φ = 964808536320.
The previous prime is 1130300002163. The next prime is 1130300002283. The reversal of 1130300002223 is 3222000030311.
It is an interprime number because it is at equal distance from previous prime (1130300002163) and next prime (1130300002283).
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 1130300002223 - 214 = 1130299985839 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130300002283) 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, 335001278 + ... + 335004651.
It is an arithmetic number, because the mean of its divisors is an integer number (162141435060).
Almost surely, 21130300002223 is an apocalyptic number.
1130300002223 is a deficient number, since it is larger than the sum of its proper divisors (166831478257).
1130300002223 is an equidigital number, since it uses as much as digits as its factorization.
1130300002223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670006177.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 1130300002223 its reverse (3222000030311), we get a palindrome (4352300032534).
The spelling of 1130300002223 in words is "one trillion, one hundred thirty billion, three hundred million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •