Base | Representation |
---|---|
bin | 1011010011000011101101… |
… | …1110100111110100110111 |
3 | 1121222112110120000022010011 |
4 | 2310300323132213310313 |
5 | 3112010321041200343 |
6 | 42230335150441051 |
7 | 2421314545625461 |
oct | 264607336476467 |
9 | 47875416008104 |
10 | 12422043303223 |
11 | 3a5a18266a174 |
12 | 1487585203187 |
13 | 6c1516b320c8 |
14 | 30d331595131 |
15 | 1681d4b4d29d |
hex | b4c3b7a7d37 |
12422043303223 has 4 divisors (see below), whose sum is σ = 12498252158008. Its totient is φ = 12345834448440.
The previous prime is 12422043303191. The next prime is 12422043303247. The reversal of 12422043303223 is 32230334022421.
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 12422043303223 - 25 = 12422043303191 is a prime.
It is a super-2 number, since 2×124220433032232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12422043303283) 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, 38104427148 + ... + 38104427473.
It is an arithmetic number, because the mean of its divisors is an integer number (3124563039502).
Almost surely, 212422043303223 is an apocalyptic number.
12422043303223 is a deficient number, since it is larger than the sum of its proper divisors (76208854785).
12422043303223 is an equidigital number, since it uses as much as digits as its factorization.
12422043303223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76208854784.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 12422043303223 its reverse (32230334022421), we get a palindrome (44652377325644).
The spelling of 12422043303223 in words is "twelve trillion, four hundred twenty-two billion, forty-three million, three hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •