Base | Representation |
---|---|
bin | 10110100000010010… |
… | …11011011111001001 |
3 | 1011012000112121122211 |
4 | 23100021123133021 |
5 | 144221002124101 |
6 | 5314520345121 |
7 | 605255610205 |
oct | 132011333711 |
9 | 34160477584 |
10 | 12082067401 |
11 | 5140015078 |
12 | 24123151a1 |
13 | 11a7169c11 |
14 | 8288a1b05 |
15 | 4aaa81c51 |
hex | 2d025b7c9 |
12082067401 has 4 divisors (see below), whose sum is σ = 12170257812. Its totient is φ = 11993876992.
The previous prime is 12082067383. The next prime is 12082067407. The reversal of 12082067401 is 10476028021.
12082067401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10221007801 + 1861059600 = 101099^2 + 43140^2 .
It is a cyclic number.
It is not a de Polignac number, because 12082067401 - 27 = 12082067273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12082067407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44095000 + ... + 44095273.
It is an arithmetic number, because the mean of its divisors is an integer number (3042564453).
Almost surely, 212082067401 is an apocalyptic number.
It is an amenable number.
12082067401 is a deficient number, since it is larger than the sum of its proper divisors (88190411).
12082067401 is an equidigital number, since it uses as much as digits as its factorization.
12082067401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88190410.
The product of its (nonzero) digits is 5376, while the sum is 31.
The spelling of 12082067401 in words is "twelve billion, eighty-two million, sixty-seven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •