Base | Representation |
---|---|
bin | 1011000110010100100111… |
… | …1101101101101000110111 |
3 | 1121012121200222122101021201 |
4 | 2301211021331231220313 |
5 | 3044414220202034143 |
6 | 41542031544553331 |
7 | 2366440511021044 |
oct | 261451175555067 |
9 | 47177628571251 |
10 | 12203243002423 |
11 | 398540359a7a0 |
12 | 14510a1482847 |
13 | 6a69b78558b5 |
14 | 3028d66801cb |
15 | 16267ae3964d |
hex | b1949f6da37 |
12203243002423 has 8 divisors (see below), whose sum is σ = 13375721759616. Its totient is φ = 11041279750200.
The previous prime is 12203243002411. The next prime is 12203243002453. The reversal of 12203243002423 is 32420034230221.
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 12203243002423 - 237 = 12065804048951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12203243002391 and 12203243002400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12203243002403) 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, 2628873811 + ... + 2628878452.
It is an arithmetic number, because the mean of its divisors is an integer number (1671965219952).
Almost surely, 212203243002423 is an apocalyptic number.
12203243002423 is a deficient number, since it is larger than the sum of its proper divisors (1172478757193).
12203243002423 is a wasteful number, since it uses less digits than its factorization.
12203243002423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5257752485.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 12203243002423 its reverse (32420034230221), we get a palindrome (44623277232644).
The spelling of 12203243002423 in words is "twelve trillion, two hundred three billion, two hundred forty-three million, two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.985 sec. • engine limits •