Base | Representation |
---|---|
bin | 10111100111000000… |
… | …10110100000110111 |
3 | 1012201100202212212012 |
4 | 23303200112200313 |
5 | 201424332411103 |
6 | 5453431114435 |
7 | 626051043620 |
oct | 136340264067 |
9 | 35640685765 |
10 | 12675278903 |
11 | 5414956711 |
12 | 2558b12a1b |
13 | 1270029941 |
14 | 88359ca47 |
15 | 4e2bad2d8 |
hex | 2f3816837 |
12675278903 has 8 divisors (see below), whose sum is σ = 14499104160. Its totient is φ = 10854721440.
The previous prime is 12675278887. The next prime is 12675278921. The reversal of 12675278903 is 30987257621.
12675278903 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 12675278903 - 24 = 12675278887 is a prime.
It is a super-3 number, since 3×126752789033 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12675278933) 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, 808628 + ... + 824153.
It is an arithmetic number, because the mean of its divisors is an integer number (1812388020).
Almost surely, 212675278903 is an apocalyptic number.
12675278903 is a deficient number, since it is larger than the sum of its proper divisors (1823825257).
12675278903 is a wasteful number, since it uses less digits than its factorization.
12675278903 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1633897.
The product of its (nonzero) digits is 1270080, while the sum is 50.
The spelling of 12675278903 in words is "twelve billion, six hundred seventy-five million, two hundred seventy-eight thousand, nine hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •