Base | Representation |
---|---|
bin | 11101011001010011111… |
… | …00110001010011100010 |
3 | 10120120001002220121110200 |
4 | 32230221330301103202 |
5 | 113022010401023020 |
6 | 2051555225410030 |
7 | 132654156535062 |
oct | 16545174612342 |
9 | 3516032817420 |
10 | 1010021111010 |
11 | 35a390649a1a |
12 | 1438ba039916 |
13 | 74324468022 |
14 | 36c573033a2 |
15 | 1b4163e4590 |
hex | eb29f314e2 |
1010021111010 has 96 divisors (see below), whose sum is σ = 2793707459712. Its totient is φ = 252294013440.
The previous prime is 1010021110997. The next prime is 1010021111041. The reversal of 1010021111010 is 101111200101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1010021110983 and 1010021111001.
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, 1241494 + ... + 1887153.
It is an arithmetic number, because the mean of its divisors is an integer number (29101119372).
Almost surely, 21010021111010 is an apocalyptic number.
1010021111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010021111010 is an abundant number, since it is smaller than the sum of its proper divisors (1783686348702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010021111010 is a wasteful number, since it uses less digits than its factorization.
1010021111010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3128888 (or 3128885 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1010021111010 its reverse (101111200101), we get a palindrome (1111132311111).
The spelling of 1010021111010 in words is "one trillion, ten billion, twenty-one million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •