Base | Representation |
---|---|
bin | 110001100100011011… |
… | …0010101100001111011 |
3 | 101011202121101112001211 |
4 | 1203020312111201323 |
5 | 3221001404333032 |
6 | 120522453223551 |
7 | 10455621511561 |
oct | 1431066254173 |
9 | 334677345054 |
10 | 106448902267 |
11 | 411656a28a4 |
12 | 18769631bb7 |
13 | a0658ac646 |
14 | 521b723a31 |
15 | 2b80495747 |
hex | 18c8d9587b |
106448902267 has 8 divisors (see below), whose sum is σ = 112220669952. Its totient is φ = 100823255400.
The previous prime is 106448902207. The next prime is 106448902271. The reversal of 106448902267 is 762209844601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106448902267 - 27 = 106448902139 is a prime.
It is a super-2 number, since 2×1064489022672 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106448902267.
It is not an unprimeable number, because it can be changed into a prime (106448902207) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 36528709 + ... + 36531622.
It is an arithmetic number, because the mean of its divisors is an integer number (14027583744).
Almost surely, 2106448902267 is an apocalyptic number.
106448902267 is a deficient number, since it is larger than the sum of its proper divisors (5771767685).
106448902267 is an equidigital number, since it uses as much as digits as its factorization.
106448902267 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73060409.
The product of its (nonzero) digits is 1161216, while the sum is 49.
The spelling of 106448902267 in words is "one hundred six billion, four hundred forty-eight million, nine hundred two thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •