Base | Representation |
---|---|
bin | 1010000100000100110001… |
… | …00100110111111101001011 |
3 | 2220100121222212111110221021 |
4 | 11002002120210313331023 |
5 | 10400040203203442303 |
6 | 115022253220053311 |
7 | 4442566522303630 |
oct | 502023044677513 |
9 | 86317885443837 |
10 | 22130231312203 |
11 | 7062418707263 |
12 | 2594ba1834237 |
13 | c46b4461b251 |
14 | 567174bca187 |
15 | 2859d1168ebd |
hex | 142098937f4b |
22130231312203 has 4 divisors (see below), whose sum is σ = 25291692928240. Its totient is φ = 18968769696168.
The previous prime is 22130231312183. The next prime is 22130231312209. The reversal of 22130231312203 is 30221313203122.
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 22130231312203 - 29 = 22130231311691 is a prime.
It is a super-2 number, since 2×221302313122032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22130231312209) 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, 1580730808008 + ... + 1580730808021.
It is an arithmetic number, because the mean of its divisors is an integer number (6322923232060).
Almost surely, 222130231312203 is an apocalyptic number.
22130231312203 is a deficient number, since it is larger than the sum of its proper divisors (3161461616037).
22130231312203 is an equidigital number, since it uses as much as digits as its factorization.
22130231312203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3161461616036.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 22130231312203 its reverse (30221313203122), we get a palindrome (52351544515325).
The spelling of 22130231312203 in words is "twenty-two trillion, one hundred thirty billion, two hundred thirty-one million, three hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •