Base | Representation |
---|---|
bin | 10110010111101111… |
… | …01111011001011101 |
3 | 1011000000112112210021 |
4 | 23023313233121131 |
5 | 144044120242001 |
6 | 5303434512141 |
7 | 603425022403 |
oct | 131367573135 |
9 | 34000475707 |
10 | 12010321501 |
11 | 5103571342 |
12 | 23b2295651 |
13 | 1195339819 |
14 | 81d147473 |
15 | 4a460dba1 |
hex | 2cbdef65d |
12010321501 has 2 divisors, whose sum is σ = 12010321502. Its totient is φ = 12010321500.
The previous prime is 12010321457. The next prime is 12010321507. The reversal of 12010321501 is 10512301021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10814960025 + 1195361476 = 103995^2 + 34574^2 .
It is a cyclic number.
It is not a de Polignac number, because 12010321501 - 29 = 12010320989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12010321507) 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 as a sum of consecutive naturals, namely, 6005160750 + 6005160751.
It is an arithmetic number, because the mean of its divisors is an integer number (6005160751).
Almost surely, 212010321501 is an apocalyptic number.
It is an amenable number.
12010321501 is a deficient number, since it is larger than the sum of its proper divisors (1).
12010321501 is an equidigital number, since it uses as much as digits as its factorization.
12010321501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 12010321501 its reverse (10512301021), we get a palindrome (22522622522).
The spelling of 12010321501 in words is "twelve billion, ten million, three hundred twenty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •