Base | Representation |
---|---|
bin | 10010110100001000… |
… | …10010111001011010 |
3 | 222001221211110210212 |
4 | 21122010102321122 |
5 | 131141324310020 |
6 | 4350151411122 |
7 | 505212111530 |
oct | 113204227132 |
9 | 28057743725 |
10 | 10101010010 |
11 | 4313836363 |
12 | 1b5a983aa2 |
13 | c4c8c5900 |
14 | 6bb738150 |
15 | 3e1bb1cc5 |
hex | 25a112e5a |
10101010010 has 96 divisors (see below), whose sum is σ = 23277248640. Its totient is φ = 3086463744.
The previous prime is 10101010009. The next prime is 10101010061. The reversal of 10101010010 is 1001010101.
It is a super-4 number, since 4×101010100104 (a number of 41 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a junction number, because it is equal to n+sod(n) for n = 10101009976 and 10101010003.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 328349 + ... + 357791.
It is an arithmetic number, because the mean of its divisors is an integer number (242471340).
Almost surely, 210101010010 is an apocalyptic number.
10101010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10101010010 is an abundant number, since it is smaller than the sum of its proper divisors (13176238630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101010010 is a wasteful number, since it uses less digits than its factorization.
10101010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29512 (or 29499 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10101010010 its reverse (1001010101), we get a palindrome (11102020111).
Subtracting from 10101010010 its reverse (1001010101), we obtain a palindrome (9099999909).
The spelling of 10101010010 in words is "ten billion, one hundred one million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •