Base | Representation |
---|---|
bin | 100110001101100… |
… | …110111000110010 |
3 | 1122200100022201220 |
4 | 212031212320302 |
5 | 2303110220422 |
6 | 143341005510 |
7 | 21613162116 |
oct | 4615467062 |
9 | 1580308656 |
10 | 641101362 |
11 | 2a9980a40 |
12 | 15a853896 |
13 | a2a89825 |
14 | 61205746 |
15 | 3b43ae5c |
hex | 26366e32 |
641101362 has 64 divisors (see below), whose sum is σ = 1439133696. Its totient is φ = 188717760.
The previous prime is 641101361. The next prime is 641101369. The reversal of 641101362 is 263101146.
641101362 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×6411013622 = 822021912716510088, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (641101361) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 632368 + ... + 633380.
It is an arithmetic number, because the mean of its divisors is an integer number (22486464).
Almost surely, 2641101362 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 641101362, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (719566848).
641101362 is an abundant number, since it is smaller than the sum of its proper divisors (798032334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641101362 is a wasteful number, since it uses less digits than its factorization.
641101362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1295.
The product of its (nonzero) digits is 864, while the sum is 24.
The square root of 641101362 is about 25319.9795023614. The cubic root of 641101362 is about 862.2679286569.
The spelling of 641101362 in words is "six hundred forty-one million, one hundred one thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •