Base | Representation |
---|---|
bin | 11000000111101000… |
… | …01011011001001111 |
3 | 1020102102122212111001 |
4 | 30003310023121033 |
5 | 203004410133240 |
6 | 5540524041131 |
7 | 635612635066 |
oct | 140364133117 |
9 | 36372585431 |
10 | 12948911695 |
11 | 5545361015 |
12 | 26146931a7 |
13 | 12b4925135 |
14 | 8aba6b1dd |
15 | 50bc0e89a |
hex | 303d0b64f |
12948911695 has 16 divisors (see below), whose sum is σ = 15842977920. Its totient is φ = 10158234624.
The previous prime is 12948911693. The next prime is 12948911741. The reversal of 12948911695 is 59611984921.
It is a happy number.
12948911695 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12948911695 - 21 = 12948911693 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12948911693) 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 15 ways as a sum of consecutive naturals, for example, 69607 + ... + 175336.
It is an arithmetic number, because the mean of its divisors is an integer number (990186120).
Almost surely, 212948911695 is an apocalyptic number.
12948911695 is a deficient number, since it is larger than the sum of its proper divisors (2894066225).
12948911695 is a wasteful number, since it uses less digits than its factorization.
12948911695 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245154.
The product of its digits is 1399680, while the sum is 55.
The spelling of 12948911695 in words is "twelve billion, nine hundred forty-eight million, nine hundred eleven thousand, six hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •