Base | Representation |
---|---|
bin | 110001100001100011… |
… | …0011100000110110110 |
3 | 101011111212220202102221 |
4 | 1203003012130012312 |
5 | 3220302212211324 |
6 | 120505130152554 |
7 | 10453340665450 |
oct | 1430306340666 |
9 | 334455822387 |
10 | 106352460214 |
11 | 41116211520 |
12 | 1874128275a |
13 | a04b913440 |
14 | 520c9bb2d0 |
15 | 2b76c950e4 |
hex | 18c319c1b6 |
106352460214 has 128 divisors (see below), whose sum is σ = 226344222720. Its totient is φ = 36094377600.
The previous prime is 106352460187. The next prime is 106352460217. The reversal of 106352460214 is 412064253601.
It is a super-2 number, since 2×1063524602142 (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 106352460214.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106352460217) 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 63 ways as a sum of consecutive naturals, for example, 9998679 + ... + 10009309.
It is an arithmetic number, because the mean of its divisors is an integer number (1768314240).
Almost surely, 2106352460214 is an apocalyptic number.
106352460214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
106352460214 is an abundant number, since it is smaller than the sum of its proper divisors (119991762506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106352460214 is a wasteful number, since it uses less digits than its factorization.
106352460214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10946.
The product of its (nonzero) digits is 34560, while the sum is 34.
The spelling of 106352460214 in words is "one hundred six billion, three hundred fifty-two million, four hundred sixty thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •