Base | Representation |
---|---|
bin | 1011001100000101101000… |
… | …1110101011011010011101 |
3 | 1121120002101110002222212110 |
4 | 2303001122032223122131 |
5 | 3103030102313224041 |
6 | 42055333151024233 |
7 | 2406545315522133 |
oct | 263013216533235 |
9 | 47502343088773 |
10 | 12302300133021 |
11 | 3a13415783088 |
12 | 146832750b079 |
13 | 6b3142c0c042 |
14 | 3076123c5753 |
15 | 1650274ca516 |
hex | b305a3ab69d |
12302300133021 has 8 divisors (see below), whose sum is σ = 16671969579424. Its totient is φ = 8067082054320.
The previous prime is 12302300133001. The next prime is 12302300133023. The reversal of 12302300133021 is 12033100320321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12302300133021 - 230 = 12301226391197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12302300133023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33612841711 + ... + 33612842076.
It is an arithmetic number, because the mean of its divisors is an integer number (2083996197428).
Almost surely, 212302300133021 is an apocalyptic number.
It is an amenable number.
12302300133021 is a deficient number, since it is larger than the sum of its proper divisors (4369669446403).
12302300133021 is an equidigital number, since it uses as much as digits as its factorization.
12302300133021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67225683851.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 12302300133021 its reverse (12033100320321), we get a palindrome (24335400453342).
The spelling of 12302300133021 in words is "twelve trillion, three hundred two billion, three hundred million, one hundred thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •