Base | Representation |
---|---|
bin | 110001100000111001… |
… | …0111010111001010110 |
3 | 101011110100201102112122 |
4 | 1203001302322321112 |
5 | 3220231111104410 |
6 | 120503025015542 |
7 | 10452653620550 |
oct | 1430162727126 |
9 | 334410642478 |
10 | 106330566230 |
11 | 41104918219 |
12 | 18735a845b2 |
13 | a047218c15 |
14 | 5209b1c4d0 |
15 | 2b74dbce55 |
hex | 18c1cbae56 |
106330566230 has 32 divisors (see below), whose sum is σ = 231604059456. Its totient is φ = 34311711744.
The previous prime is 106330566217. The next prime is 106330566241. The reversal of 106330566230 is 32665033601.
It is a super-2 number, since 2×1063305662302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 44675519 + ... + 44677898.
It is an arithmetic number, because the mean of its divisors is an integer number (7237626858).
Almost surely, 2106330566230 is an apocalyptic number.
106330566230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
106330566230 is an abundant number, since it is smaller than the sum of its proper divisors (125273493226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106330566230 is a wasteful number, since it uses less digits than its factorization.
106330566230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89353448.
The product of its (nonzero) digits is 58320, while the sum is 35.
Adding to 106330566230 its reverse (32665033601), we get a palindrome (138995599831).
The spelling of 106330566230 in words is "one hundred six billion, three hundred thirty million, five hundred sixty-six thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •