Base | Representation |
---|---|
bin | 110000110000010001… |
… | …1110111100100000111 |
3 | 101000020200001222120201 |
4 | 1201200203313210013 |
5 | 3203411000333341 |
6 | 120033111511331 |
7 | 10364354526613 |
oct | 1414043674407 |
9 | 330220058521 |
10 | 104699230471 |
11 | 40447a93550 |
12 | 1835b688547 |
13 | 9b472611a4 |
14 | 50d31cc343 |
15 | 2acba7e331 |
hex | 18608f7907 |
104699230471 has 16 divisors (see below), whose sum is σ = 121251852288. Its totient is φ = 89348272000.
The previous prime is 104699230469. The next prime is 104699230507. The reversal of 104699230471 is 174032996401.
It is a cyclic number.
It is not a de Polignac number, because 104699230471 - 21 = 104699230469 is a prime.
It is a super-3 number, since 3×1046992304713 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104699230871) 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, 659305 + ... + 802546.
It is an arithmetic number, because the mean of its divisors is an integer number (7578240768).
Almost surely, 2104699230471 is an apocalyptic number.
104699230471 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
104699230471 is a deficient number, since it is larger than the sum of its proper divisors (16552621817).
104699230471 is a wasteful number, since it uses less digits than its factorization.
104699230471 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462262.
The product of its (nonzero) digits is 326592, while the sum is 46.
The spelling of 104699230471 in words is "one hundred four billion, six hundred ninety-nine million, two hundred thirty thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •