Base | Representation |
---|---|
bin | 1011001100000001010001… |
… | …1111101111001111100001 |
3 | 1121112222100220200020112001 |
4 | 2303000110133233033201 |
5 | 3103020203312400113 |
6 | 42055021115204001 |
7 | 2406504321331603 |
oct | 263002437571741 |
9 | 47488326606461 |
10 | 12301130200033 |
11 | 3a12975343114 |
12 | 146805b746601 |
13 | 6b2cb77141bc |
14 | 307540c81173 |
15 | 164ea992d7dd |
hex | b30147ef3e1 |
12301130200033 has 8 divisors (see below), whose sum is σ = 12307372649280. Its totient is φ = 12294888088560.
The previous prime is 12301130199983. The next prime is 12301130200039. The reversal of 12301130200033 is 33000203110321.
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 12301130200033 - 229 = 12300593329121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12301130200039) 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, 106005438 + ... + 106121416.
It is an arithmetic number, because the mean of its divisors is an integer number (1538421581160).
Almost surely, 212301130200033 is an apocalyptic number.
It is an amenable number.
12301130200033 is a deficient number, since it is larger than the sum of its proper divisors (6242449247).
12301130200033 is a wasteful number, since it uses less digits than its factorization.
12301130200033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168887.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 12301130200033 its reverse (33000203110321), we get a palindrome (45301333310354).
The spelling of 12301130200033 in words is "twelve trillion, three hundred one billion, one hundred thirty million, two hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •