Base | Representation |
---|---|
bin | 10011010001010011… |
… | …01111100010010101 |
3 | 222201000021101220010 |
4 | 21220221233202111 |
5 | 132142000121134 |
6 | 4430332230433 |
7 | 514243031013 |
oct | 115051574225 |
9 | 28630241803 |
10 | 10345707669 |
11 | 4429978330 |
12 | 200890b419 |
13 | c8b4cca1b |
14 | 7020338b3 |
15 | 4083e9ce9 |
hex | 268a6f895 |
10345707669 has 8 divisors (see below), whose sum is σ = 15048302112. Its totient is φ = 6270125840.
The previous prime is 10345707599. The next prime is 10345707721. The reversal of 10345707669 is 96670754301.
It is a happy number.
10345707669 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10345707669 - 216 = 10345642133 is a prime.
It is a super-2 number, since 2×103457076692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10345707769) 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 7 ways as a sum of consecutive naturals, for example, 156753114 + ... + 156753179.
It is an arithmetic number, because the mean of its divisors is an integer number (1881037764).
Almost surely, 210345707669 is an apocalyptic number.
It is an amenable number.
10345707669 is a deficient number, since it is larger than the sum of its proper divisors (4702594443).
10345707669 is a wasteful number, since it uses less digits than its factorization.
10345707669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313506307.
The product of its (nonzero) digits is 952560, while the sum is 48.
The spelling of 10345707669 in words is "ten billion, three hundred forty-five million, seven hundred seven thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •