Base | Representation |
---|---|
bin | 1100101100010… |
… | …10010100011110 |
3 | 21102100101010121 |
4 | 12112022110132 |
5 | 204224111414 |
6 | 14322025154 |
7 | 2432001064 |
oct | 626122436 |
9 | 242311117 |
10 | 106472734 |
11 | 551125a5 |
12 | 2b7a81ba |
13 | 1909ba24 |
14 | 101d8034 |
15 | 9532724 |
hex | 658a51e |
106472734 has 8 divisors (see below), whose sum is σ = 169103808. Its totient is φ = 50104800.
The previous prime is 106472671. The next prime is 106472783. The reversal of 106472734 is 437274601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1064727342 = 22672886170869512, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34), and also a Moran number because the ratio is a prime number: 3131551 = 106472734 / (1 + 0 + 6 + 4 + 7 + 2 + 7 + 3 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 106472734.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1565742 + ... + 1565809.
It is an arithmetic number, because the mean of its divisors is an integer number (21137976).
Almost surely, 2106472734 is an apocalyptic number.
106472734 is a deficient number, since it is larger than the sum of its proper divisors (62631074).
106472734 is a wasteful number, since it uses less digits than its factorization.
106472734 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3131570.
The product of its (nonzero) digits is 28224, while the sum is 34.
The square root of 106472734 is about 10318.5625936949. The cubic root of 106472734 is about 473.9648504857.
The spelling of 106472734 in words is "one hundred six million, four hundred seventy-two thousand, seven hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •