Base | Representation |
---|---|
bin | 10110011100110101… |
… | …00110001001101111 |
3 | 1011002222212111122201 |
4 | 23032122212021233 |
5 | 144141032404403 |
6 | 5312001522331 |
7 | 604453630615 |
oct | 131632461157 |
9 | 34088774581 |
10 | 12053013103 |
11 | 512568015a |
12 | 24046433a7 |
13 | 11a1136521 |
14 | 824a9b6b5 |
15 | 4a824321d |
hex | 2ce6a626f |
12053013103 has 4 divisors (see below), whose sum is σ = 12092274040. Its totient is φ = 12013752168.
The previous prime is 12053013101. The next prime is 12053013113. The reversal of 12053013103 is 30131035021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30131035021 = 293 ⋅102836297.
It is a cyclic number.
It is not a de Polignac number, because 12053013103 - 21 = 12053013101 is a prime.
It is a super-2 number, since 2×120530131032 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12053013101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19630008 + ... + 19630621.
It is an arithmetic number, because the mean of its divisors is an integer number (3023068510).
Almost surely, 212053013103 is an apocalyptic number.
12053013103 is a deficient number, since it is larger than the sum of its proper divisors (39260937).
12053013103 is an equidigital number, since it uses as much as digits as its factorization.
12053013103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39260936.
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 12053013103 its reverse (30131035021), we get a palindrome (42184048124).
The spelling of 12053013103 in words is "twelve billion, fifty-three million, thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •