Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …1000000110101101101000 |
3 | 1022102221120211221221212120 |
4 | 2101222203020012231220 |
5 | 2303001000204014121 |
6 | 33142311351111240 |
7 | 2052125252210616 |
oct | 221524310065550 |
9 | 38387524857776 |
10 | 10010010610536 |
11 | 320a249035972 |
12 | 1158010372520 |
13 | 577c2b0bc401 |
14 | 2686b68546b6 |
15 | 1255b3be9bc6 |
hex | 91aa3206b68 |
10010010610536 has 128 divisors (see below), whose sum is σ = 26305577625600. Its totient is φ = 3168077172480.
The previous prime is 10010010610529. The next prime is 10010010610541. The reversal of 10010010610536 is 63501601001001.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 771953925 + ... + 771966891.
It is an arithmetic number, because the mean of its divisors is an integer number (205512325200).
Almost surely, 210010010610536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10010010610536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13152788812800).
10010010610536 is an abundant number, since it is smaller than the sum of its proper divisors (16295567015064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010010610536 is a wasteful number, since it uses less digits than its factorization.
10010010610536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23199 (or 23195 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 24.
Adding to 10010010610536 its reverse (63501601001001), we get a palindrome (73511611611537).
The spelling of 10010010610536 in words is "ten trillion, ten billion, ten million, six hundred ten thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •