Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …110001100000000111110010 |
3 | 111020122120001021011220101120 |
4 | 112331321310301200013302 |
5 | 101214431012000013020 |
6 | 554455451321243110 |
7 | 30163542513310131 |
oct | 2675716461400762 |
9 | 436576037156346 |
10 | 101011000001010 |
11 | 2a2045851706a0 |
12 | b3b4737633496 |
13 | 44493b1339708 |
14 | 1ad2d5c129918 |
15 | ba27dbac5740 |
hex | 5bde74c601f2 |
101011000001010 has 64 divisors (see below), whose sum is σ = 265926297297024. Its totient is φ = 24352224998400.
The previous prime is 101011000000987. The next prime is 101011000001017. The reversal of 101011000001010 is 10100000110101.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a self number, because there is not a number n which added to its sum of digits gives 101011000001010.
It is not an unprimeable number, because it can be changed into a prime (101011000001017) 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, 845503639 + ... + 845623098.
It is an arithmetic number, because the mean of its divisors is an integer number (4155098395266).
Almost surely, 2101011000001010 is an apocalyptic number.
101011000001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101011000001010 is an abundant number, since it is smaller than the sum of its proper divisors (164915297296014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101011000001010 is a wasteful number, since it uses less digits than its factorization.
101011000001010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1691126939.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101011000001010 its reverse (10100000110101), we get a palindrome (111111000111111).
The spelling of 101011000001010 in words is "one hundred one trillion, eleven billion, one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •