Base | Representation |
---|---|
bin | 110001011111001101… |
… | …0101100110100011101 |
3 | 101011022102001202011012 |
4 | 1202332122230310131 |
5 | 3220122103313334 |
6 | 120453242105005 |
7 | 10451365056533 |
oct | 1427632546435 |
9 | 334272052135 |
10 | 106273885469 |
11 | 41085924114 |
12 | 1871aaab165 |
13 | a0385619cb |
14 | 52023a6153 |
15 | 2b6ee239ce |
hex | 18be6acd1d |
106273885469 has 4 divisors (see below), whose sum is σ = 106305908640. Its totient is φ = 106241862300.
The previous prime is 106273885433. The next prime is 106273885513. The reversal of 106273885469 is 964588372601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106273885469 - 28 = 106273885213 is a prime.
It is a super-2 number, since 2×1062738854692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106273885409) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16006607 + ... + 16013244.
It is an arithmetic number, because the mean of its divisors is an integer number (26576477160).
It is a 1-persistent number, because it is pandigital, but 2⋅106273885469 = 212547770938 is not.
Almost surely, 2106273885469 is an apocalyptic number.
It is an amenable number.
106273885469 is a deficient number, since it is larger than the sum of its proper divisors (32023171).
106273885469 is an equidigital number, since it uses as much as digits as its factorization.
106273885469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32023170.
The product of its (nonzero) digits is 17418240, while the sum is 59.
The spelling of 106273885469 in words is "one hundred six billion, two hundred seventy-three million, eight hundred eighty-five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •