Base | Representation |
---|---|
bin | 10110011000001000… |
… | …11100010100111111 |
3 | 1011000020210201100210 |
4 | 23030010130110333 |
5 | 144100443320023 |
6 | 5304034123503 |
7 | 603465231225 |
oct | 131404342477 |
9 | 34006721323 |
10 | 12013651263 |
11 | 5105436009 |
12 | 23b3420593 |
13 | 1195c342b3 |
14 | 81d772b15 |
15 | 4a4a6a593 |
hex | 2cc11c53f |
12013651263 has 8 divisors (see below), whose sum is σ = 16036766208. Its totient is φ = 7999818584.
The previous prime is 12013651259. The next prime is 12013651271. The reversal of 12013651263 is 36215631021.
12013651263 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12013651263 - 22 = 12013651259 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12013651263.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12013651763) 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 7 ways as a sum of consecutive naturals, for example, 2317545 + ... + 2322722.
It is an arithmetic number, because the mean of its divisors is an integer number (2004595776).
Almost surely, 212013651263 is an apocalyptic number.
12013651263 is a deficient number, since it is larger than the sum of its proper divisors (4023114945).
12013651263 is an equidigital number, since it uses as much as digits as its factorization.
12013651263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4641133.
The product of its (nonzero) digits is 6480, while the sum is 30.
The spelling of 12013651263 in words is "twelve billion, thirteen million, six hundred fifty-one thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •