Base | Representation |
---|---|
bin | 110010000010011011… |
… | …1001010011011111001 |
3 | 101021100202221210011001 |
4 | 1210010313022123321 |
5 | 3230032133030204 |
6 | 121210421405001 |
7 | 10522565551411 |
oct | 1440467123371 |
9 | 337322853131 |
10 | 107455751929 |
11 | 41631a74959 |
12 | 189aa869761 |
13 | a196377486 |
14 | 52b5335641 |
15 | 2bdda7b4a4 |
hex | 1904dca6f9 |
107455751929 has 16 divisors (see below), whose sum is σ = 116214436800. Its totient is φ = 99042960384.
The previous prime is 107455751917. The next prime is 107455751939. The reversal of 107455751929 is 929157554701.
It is a cyclic number.
It is not a de Polignac number, because 107455751929 - 213 = 107455743737 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107455751929.
It is not an unprimeable number, because it can be changed into a prime (107455751939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 385372 + ... + 602845.
It is an arithmetic number, because the mean of its divisors is an integer number (7263402300).
Almost surely, 2107455751929 is an apocalyptic number.
107455751929 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
107455751929 is a deficient number, since it is larger than the sum of its proper divisors (8758684871).
107455751929 is an equidigital number, since it uses as much as digits as its factorization.
107455751929 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 988392.
The product of its (nonzero) digits is 3969000, while the sum is 55.
The spelling of 107455751929 in words is "one hundred seven billion, four hundred fifty-five million, seven hundred fifty-one thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •