Base | Representation |
---|---|
bin | 10011110110010000… |
… | …00001011111010110 |
3 | 1000111121110100211111 |
4 | 21323020001133112 |
5 | 133310320313124 |
6 | 4521203125234 |
7 | 525025256314 |
oct | 117310013726 |
9 | 30447410744 |
10 | 10655635414 |
11 | 4578912666 |
12 | 209467381a |
13 | 100a795518 |
14 | 73126d0b4 |
15 | 42571a494 |
hex | 27b2017d6 |
10655635414 has 4 divisors (see below), whose sum is σ = 15983453124. Its totient is φ = 5327817706.
The previous prime is 10655635399. The next prime is 10655635429. The reversal of 10655635414 is 41453655601.
It is a happy number.
10655635414 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 41453655601 = 167953 ⋅246817.
It is an interprime number because it is at equal distance from previous prime (10655635399) and next prime (10655635429).
It is a super-2 number, since 2×106556354142 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 2663908852 + ... + 2663908855.
It is an arithmetic number, because the mean of its divisors is an integer number (3995863281).
Almost surely, 210655635414 is an apocalyptic number.
10655635414 is a deficient number, since it is larger than the sum of its proper divisors (5327817710).
10655635414 is an equidigital number, since it uses as much as digits as its factorization.
10655635414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5327817709.
The product of its (nonzero) digits is 216000, while the sum is 40.
The spelling of 10655635414 in words is "ten billion, six hundred fifty-five million, six hundred thirty-five thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •