Base | Representation |
---|---|
bin | 10110111101111000111111… |
… | …110010101001101101111010 |
3 | 111020122110202022120120011200 |
4 | 112331320333302221231322 |
5 | 101214422201421010020 |
6 | 554455223205235030 |
7 | 30163511501000154 |
oct | 2675707762515572 |
9 | 436573668516150 |
10 | 101010111110010 |
11 | 2a204169436733 |
12 | b3b4529a02a76 |
13 | 444929c1325cb |
14 | 1ad2cb6061ad4 |
15 | ba2788a40590 |
hex | 5bde3fca9b7a |
101010111110010 has 48 divisors (see below), whose sum is σ = 264077262900360. Its totient is φ = 26787211781760.
The previous prime is 101010111109967. The next prime is 101010111110017. The reversal of 101010111110010 is 10011111010101.
101010111110010 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 56867601005721 + 44142510104289 = 7541061^2 + 6643983^2 .
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 = 101010111109974 and 101010111110001.
It is not an unprimeable number, because it can be changed into a prime (101010111110017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3100355445 + ... + 3100388024.
Almost surely, 2101010111110010 is an apocalyptic number.
101010111110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101010111110010 is an abundant number, since it is smaller than the sum of its proper divisors (163067151790350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101010111110010 is a wasteful number, since it uses less digits than its factorization.
101010111110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6200743663 (or 6200743660 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101010111110010 its reverse (10011111010101), we get a palindrome (111021222120111).
Subtracting from 101010111110010 its reverse (10011111010101), we obtain a palindrome (90999000099909).
The spelling of 101010111110010 in words is "one hundred one trillion, ten billion, one hundred eleven million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •