Base | Representation |
---|---|
bin | 1011010100110111110010… |
… | …1101010000100011111011 |
3 | 1122002111220002101221210011 |
4 | 2311031330231100203323 |
5 | 3113013124310231303 |
6 | 42252531111002351 |
7 | 2423466652060333 |
oct | 265157455204373 |
9 | 48074802357704 |
10 | 12453202430203 |
11 | 3a71412132487 |
12 | 14916203693b7 |
13 | 6c44413aa652 |
14 | 310a499300c3 |
15 | 168e0a3dc16d |
hex | b537cb508fb |
12453202430203 has 8 divisors (see below), whose sum is σ = 12482318115072. Its totient is φ = 12424120702056.
The previous prime is 12453202430147. The next prime is 12453202430213. The reversal of 12453202430203 is 30203420235421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12453202430203 is a prime.
It is a super-2 number, since 2×124532024302032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12453202430213) 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, 7754775 + ... + 9221872.
It is an arithmetic number, because the mean of its divisors is an integer number (1560289764384).
Almost surely, 212453202430203 is an apocalyptic number.
12453202430203 is a deficient number, since it is larger than the sum of its proper divisors (29115684869).
12453202430203 is an equidigital number, since it uses as much as digits as its factorization.
12453202430203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16978361.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 12453202430203 its reverse (30203420235421), we get a palindrome (42656622665624).
The spelling of 12453202430203 in words is "twelve trillion, four hundred fifty-three billion, two hundred two million, four hundred thirty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •