Base | Representation |
---|---|
bin | 111011110100110111… |
… | …1010000101010101111 |
3 | 110021121200101020121020 |
4 | 1313221233100222233 |
5 | 4101104214010301 |
6 | 135004300305223 |
7 | 12165513001044 |
oct | 1675157205257 |
9 | 407550336536 |
10 | 128475531951 |
11 | 4a5390a7788 |
12 | 20a96242213 |
13 | c1660c6530 |
14 | 630ac371cb |
15 | 351e0d4436 |
hex | 1de9bd0aaf |
128475531951 has 32 divisors (see below), whose sum is σ = 190404721920. Its totient is φ = 76561714944.
The previous prime is 128475531949. The next prime is 128475531971. The reversal of 128475531951 is 159135574821.
It is a happy number.
It is not a de Polignac number, because 128475531951 - 21 = 128475531949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 128475531894 and 128475531903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128475531971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 262510 + ... + 570843.
It is an arithmetic number, because the mean of its divisors is an integer number (5950147560).
Almost surely, 2128475531951 is an apocalyptic number.
128475531951 is a deficient number, since it is larger than the sum of its proper divisors (61929189969).
128475531951 is a wasteful number, since it uses less digits than its factorization.
128475531951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 833495.
The product of its digits is 1512000, while the sum is 51.
The spelling of 128475531951 in words is "one hundred twenty-eight billion, four hundred seventy-five million, five hundred thirty-one thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •