Base | Representation |
---|---|
bin | 10111100110101100… |
… | …10000000100110111 |
3 | 1012201011210100202020 |
4 | 23303112100010313 |
5 | 201423143143340 |
6 | 5453254244223 |
7 | 626016405225 |
oct | 136326200467 |
9 | 35634710666 |
10 | 12672631095 |
11 | 5413408343 |
12 | 2558056673 |
13 | 126c6106a7 |
14 | 8830adb15 |
15 | 4e28389d0 |
hex | 2f3590137 |
12672631095 has 16 divisors (see below), whose sum is σ = 20476966752. Its totient is φ = 6691817600.
The previous prime is 12672631087. The next prime is 12672631099. The reversal of 12672631095 is 59013627621.
12672631095 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12672631095 - 23 = 12672631087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12672631099) 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, 4180872 + ... + 4183901.
It is an arithmetic number, because the mean of its divisors is an integer number (1279810422).
Almost surely, 212672631095 is an apocalyptic number.
12672631095 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12672631095 is a deficient number, since it is larger than the sum of its proper divisors (7804335657).
12672631095 is a wasteful number, since it uses less digits than its factorization.
12672631095 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8364882.
The product of its (nonzero) digits is 136080, while the sum is 42.
It can be divided in two parts, 1267 and 2631095, that added together give a palindrome (2632362).
The spelling of 12672631095 in words is "twelve billion, six hundred seventy-two million, six hundred thirty-one thousand, ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •