Base | Representation |
---|---|
bin | 10011000000000011… |
… | …10001010110111010 |
3 | 222022221000002021000 |
4 | 21200001301112322 |
5 | 131342424333032 |
6 | 4404123025430 |
7 | 510535111503 |
oct | 114001612672 |
9 | 28287002230 |
10 | 10201011642 |
11 | 4365229038 |
12 | 1b8836b276 |
13 | c6753a083 |
14 | 6cab29baa |
15 | 3ea866e7c |
hex | 2600715ba |
10201011642 has 64 divisors (see below), whose sum is σ = 23285001600. Its totient is φ = 3308376960.
The previous prime is 10201011641. The next prime is 10201011649. The reversal of 10201011642 is 24611010201.
10201011642 is a `hidden beast` number, since 1 + 0 + 2 + 0 + 10 + 11 + 642 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10201011641) 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, 833028 + ... + 845184.
It is an arithmetic number, because the mean of its divisors is an integer number (363828150).
Almost surely, 210201011642 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10201011642, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11642500800).
10201011642 is an abundant number, since it is smaller than the sum of its proper divisors (13083989958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201011642 is a wasteful number, since it uses less digits than its factorization.
10201011642 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12588 (or 12582 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 10201011642 its reverse (24611010201), we get a palindrome (34812021843).
The spelling of 10201011642 in words is "ten billion, two hundred one million, eleven thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •