Base | Representation |
---|---|
bin | 1010111011010001001001… |
… | …1101011011001000010111 |
3 | 1120112110111211220101000121 |
4 | 2232310102131123020113 |
5 | 3033311301301330403 |
6 | 41314503223252411 |
7 | 2346635411420332 |
oct | 256642235331027 |
9 | 46473454811017 |
10 | 12013333230103 |
11 | 391190a46aa37 |
12 | 1420320baa107 |
13 | 691b10b2565a |
14 | 2d763c6cb619 |
15 | 15c7637473bd |
hex | aed1275b217 |
12013333230103 has 4 divisors (see below), whose sum is σ = 12013376399800. Its totient is φ = 12013290060408.
The previous prime is 12013333230089. The next prime is 12013333230113. The reversal of 12013333230103 is 30103233331021.
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 12013333230103 - 25 = 12013333230071 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 (12013333230113) 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, 21164700 + ... + 21724897.
It is an arithmetic number, because the mean of its divisors is an integer number (3003344099950).
Almost surely, 212013333230103 is an apocalyptic number.
12013333230103 is a deficient number, since it is larger than the sum of its proper divisors (43169697).
12013333230103 is an equidigital number, since it uses as much as digits as its factorization.
12013333230103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43169696.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 12013333230103 its reverse (30103233331021), we get a palindrome (42116566561124).
The spelling of 12013333230103 in words is "twelve trillion, thirteen billion, three hundred thirty-three million, two hundred thirty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •