Base | Representation |
---|---|
bin | 10110111101111001110101… |
… | …011000000100011000100010 |
3 | 111020122120001222012112201000 |
4 | 112331321311120010120202 |
5 | 101214431022042023020 |
6 | 554455452322052430 |
7 | 30163542665245266 |
oct | 2675716530043042 |
9 | 436576058175630 |
10 | 101011010111010 |
11 | 2a20458a94646a |
12 | b3b473aaaa116 |
13 | 44493b346936c |
14 | 1ad2d5d5dc0a6 |
15 | ba27dc921090 |
hex | 5bde75604622 |
101011010111010 has 128 divisors (see below), whose sum is σ = 278789257209600. Its totient is φ = 25994534307840.
The previous prime is 101011010110973. The next prime is 101011010111017. The reversal of 101011010111010 is 10111010110101.
101011010111010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 = 101011010110983 and 101011010111001.
It is not an unprimeable number, because it can be changed into a prime (101011010111017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12595165 + ... + 18991055.
It is an arithmetic number, because the mean of its divisors is an integer number (2178041071950).
Almost surely, 2101011010111010 is an apocalyptic number.
101011010111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 101011010111010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (139394628604800).
101011010111010 is an abundant number, since it is smaller than the sum of its proper divisors (177778247098590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011010111010 is a wasteful number, since it uses less digits than its factorization.
101011010111010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6397953 (or 6397947 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101011010111010 its reverse (10111010110101), we get a palindrome (111122020221111).
Subtracting from 101011010111010 its reverse (10111010110101), we obtain a palindrome (90900000000909).
The spelling of 101011010111010 in words is "one hundred one trillion, eleven billion, ten million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •