Base | Representation |
---|---|
bin | 110001000010111110… |
… | …0001100011100011110 |
3 | 101001212101010200122222 |
4 | 1202011330030130132 |
5 | 3211202022130241 |
6 | 120215233305342 |
7 | 10416041216552 |
oct | 1420574143436 |
9 | 331771120588 |
10 | 105326364446 |
11 | 40739a94596 |
12 | 184b5705252 |
13 | 9c1716a394 |
14 | 51525d9862 |
15 | 2b16b5ba4b |
hex | 1885f0c71e |
105326364446 has 8 divisors (see below), whose sum is σ = 158089608120. Its totient is φ = 52629828408.
The previous prime is 105326364443. The next prime is 105326364457. The reversal of 105326364446 is 644463623501.
105326364446 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1053263644462 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105326364397 and 105326364406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105326364443) 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, 16672961 + ... + 16679276.
It is an arithmetic number, because the mean of its divisors is an integer number (19761201015).
Almost surely, 2105326364446 is an apocalyptic number.
105326364446 is a deficient number, since it is larger than the sum of its proper divisors (52763243674).
105326364446 is a wasteful number, since it uses less digits than its factorization.
105326364446 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33353818.
The product of its (nonzero) digits is 1244160, while the sum is 44.
Adding to 105326364446 its reverse (644463623501), we get a palindrome (749789987947).
The spelling of 105326364446 in words is "one hundred five billion, three hundred twenty-six million, three hundred sixty-four thousand, four hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •