Base | Representation |
---|---|
bin | 1011001000110010000011… |
… | …0111110001011110110011 |
3 | 1121100122210011202111212102 |
4 | 2302030200313301132303 |
5 | 3101112242313034103 |
6 | 42013301224451015 |
7 | 2402464662145661 |
oct | 262144067613663 |
9 | 47318704674772 |
10 | 12245503252403 |
11 | 39a131a38a023 |
12 | 1459316319a6b |
13 | 6aa990c73485 |
14 | 3049850cdc31 |
15 | 16380108ee88 |
hex | b2320df17b3 |
12245503252403 has 4 divisors (see below), whose sum is σ = 12334886487960. Its totient is φ = 12156120016848.
The previous prime is 12245503252399. The next prime is 12245503252417. The reversal of 12245503252403 is 30425230554221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12245503252403 - 22 = 12245503252399 is a prime.
It is a super-2 number, since 2×122455032524032 (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 (12245503212403) 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 3 ways as a sum of consecutive naturals, for example, 44691617573 + ... + 44691617846.
It is an arithmetic number, because the mean of its divisors is an integer number (3083721621990).
Almost surely, 212245503252403 is an apocalyptic number.
12245503252403 is a deficient number, since it is larger than the sum of its proper divisors (89383235557).
12245503252403 is an equidigital number, since it uses as much as digits as its factorization.
12245503252403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89383235556.
The product of its (nonzero) digits is 288000, while the sum is 38.
The spelling of 12245503252403 in words is "twelve trillion, two hundred forty-five billion, five hundred three million, two hundred fifty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •