Base | Representation |
---|---|
bin | 111100000001110000… |
… | …0000001111010010011 |
3 | 110022201210200001010122 |
4 | 1320003200001322103 |
5 | 4103000340400323 |
6 | 135115220220455 |
7 | 12212311525112 |
oct | 1700340017223 |
9 | 408653601118 |
10 | 128907746963 |
11 | 4a740076276 |
12 | 20b96b3a72b |
13 | c204807068 |
14 | 634c3c5c79 |
15 | 354700cec8 |
hex | 1e03801e93 |
128907746963 has 4 divisors (see below), whose sum is σ = 128909194560. Its totient is φ = 128906299368.
The previous prime is 128907746917. The next prime is 128907746971. The reversal of 128907746963 is 369647709821.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 369647709821 = 13 ⋅28434439217.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-128907746963 is a prime.
It is a super-3 number, since 3×1289077469633 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 128907746896 and 128907746905.
It is not an unprimeable number, because it can be changed into a prime (128907746263) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 580808 + ... + 771461.
It is an arithmetic number, because the mean of its divisors is an integer number (32227298640).
Almost surely, 2128907746963 is an apocalyptic number.
128907746963 is a deficient number, since it is larger than the sum of its proper divisors (1447597).
128907746963 is an equidigital number, since it uses as much as digits as its factorization.
128907746963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1447596.
The product of its (nonzero) digits is 27433728, while the sum is 62.
The spelling of 128907746963 in words is "one hundred twenty-eight billion, nine hundred seven million, seven hundred forty-six thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •