Base | Representation |
---|---|
bin | 10000011100100101010… |
… | …111100001101101010110 |
3 | 11000001020210221120010120 |
4 | 100130211113201231112 |
5 | 122004124022320342 |
6 | 2223112551332410 |
7 | 144440330511321 |
oct | 20344527415526 |
9 | 4001223846116 |
10 | 1130203323222 |
11 | 3a6353347846 |
12 | 16305a981106 |
13 | 8276831c16c |
14 | 3c9b891b7b8 |
15 | 1e5ec38daec |
hex | 107255e1b56 |
1130203323222 has 8 divisors (see below), whose sum is σ = 2260406646456. Its totient is φ = 376734441072.
The previous prime is 1130203323167. The next prime is 1130203323307. The reversal of 1130203323222 is 2223233020311.
It is a sphenic number, since it is the product of 3 distinct primes.
1130203323222 is an admirable number.
It is a super-2 number, since 2×11302033232222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1130203323192 and 1130203323201.
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, 94183610263 + ... + 94183610274.
It is an arithmetic number, because the mean of its divisors is an integer number (282550830807).
Almost surely, 21130203323222 is an apocalyptic number.
1130203323222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130203323222 is a wasteful number, since it uses less digits than its factorization.
1130203323222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 188367220542.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 1130203323222 its reverse (2223233020311), we get a palindrome (3353436343533).
The spelling of 1130203323222 in words is "one trillion, one hundred thirty billion, two hundred three million, three hundred twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •