Base | Representation |
---|---|
bin | 1011001100001001011000… |
… | …0000010100101110001111 |
3 | 1121120011222100012001212212 |
4 | 2303002112000110232033 |
5 | 3103034131032044043 |
6 | 42100020454021035 |
7 | 2406612214005314 |
oct | 263022600245617 |
9 | 47504870161785 |
10 | 12303303003023 |
11 | 3a1388a88716a |
12 | 146856734777b |
13 | 6b3272912646 |
14 | 3076a967cd0b |
15 | 165085577018 |
hex | b3096014b8f |
12303303003023 has 16 divisors (see below), whose sum is σ = 13426992844800. Its totient is φ = 11230511703840.
The previous prime is 12303303002999. The next prime is 12303303003031. The reversal of 12303303003023 is 32030030330321.
It is a de Polignac number, because none of the positive numbers 2k-12303303003023 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12303303003023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12303303003223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45473111 + ... + 45742872.
It is an arithmetic number, because the mean of its divisors is an integer number (839187052800).
Almost surely, 212303303003023 is an apocalyptic number.
12303303003023 is a deficient number, since it is larger than the sum of its proper divisors (1123689841777).
12303303003023 is a wasteful number, since it uses less digits than its factorization.
12303303003023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91216262.
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 12303303003023 its reverse (32030030330321), we get a palindrome (44333333333344).
The spelling of 12303303003023 in words is "twelve trillion, three hundred three billion, three hundred three million, three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •