Base | Representation |
---|---|
bin | 101111001110010110… |
… | …1011100100000110001 |
3 | 100200202200012211211120 |
4 | 1132130231130200301 |
5 | 3130143313004034 |
6 | 114331053132453 |
7 | 10220055506643 |
oct | 1363455344061 |
9 | 320680184746 |
10 | 101413406769 |
11 | 3a011251574 |
12 | 177a318a129 |
13 | 97425a35cc |
14 | 4ca0a62893 |
15 | 298837bc49 |
hex | 179cb5c831 |
101413406769 has 8 divisors (see below), whose sum is σ = 135220782912. Its totient is φ = 67607484240.
The previous prime is 101413406761. The next prime is 101413406771. The reversal of 101413406769 is 967604314101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101413406769 - 23 = 101413406761 is a prime.
It is a super-2 number, since 2×1014134067692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101413406769.
It is not an unprimeable number, because it can be changed into a prime (101413406761) 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 7 ways as a sum of consecutive naturals, for example, 188602 + ... + 488259.
It is an arithmetic number, because the mean of its divisors is an integer number (16902597864).
Almost surely, 2101413406769 is an apocalyptic number.
It is an amenable number.
101413406769 is a deficient number, since it is larger than the sum of its proper divisors (33807376143).
101413406769 is an equidigital number, since it uses as much as digits as its factorization.
101413406769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 726807.
The product of its (nonzero) digits is 108864, while the sum is 42.
The spelling of 101413406769 in words is "one hundred one billion, four hundred thirteen million, four hundred six thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •