Base | Representation |
---|---|
bin | 1011000000011111010001… |
… | …0001111101000111001111 |
3 | 1120212001000100200100011102 |
4 | 2300013310101331013033 |
5 | 3041243441413022203 |
6 | 41424015020213315 |
7 | 2356262101644326 |
oct | 260076421750717 |
9 | 46761010610142 |
10 | 12103021220303 |
11 | 3946953a54492 |
12 | 143579139a23b |
13 | 69a405103540 |
14 | 2dbb09dab0bd |
15 | 15ec624e1888 |
hex | b01f447d1cf |
12103021220303 has 16 divisors (see below), whose sum is σ = 13201541498880. Its totient is φ = 11028486414816.
The previous prime is 12103021220243. The next prime is 12103021220317. The reversal of 12103021220303 is 30302212030121.
It is not a de Polignac number, because 12103021220303 - 212 = 12103021216207 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 (12103021220603) 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 15 ways as a sum of consecutive naturals, for example, 4240826 + ... + 6495432.
It is an arithmetic number, because the mean of its divisors is an integer number (825096343680).
Almost surely, 212103021220303 is an apocalyptic number.
12103021220303 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12103021220303 is a deficient number, since it is larger than the sum of its proper divisors (1098520278577).
12103021220303 is a wasteful number, since it uses less digits than its factorization.
12103021220303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2259926.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 12103021220303 its reverse (30302212030121), we get a palindrome (42405233250424).
The spelling of 12103021220303 in words is "twelve trillion, one hundred three billion, twenty-one million, two hundred twenty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •