Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …010011000100111101011010 |
3 | 111021000010011111201111201122 |
4 | 112333112331103010331122 |
5 | 101223100312224310020 |
6 | 555013430322045242 |
7 | 30204012602000255 |
oct | 2677267523047532 |
9 | 437003144644648 |
10 | 101111001010010 |
11 | 2a242a31125882 |
12 | b40bba57a9822 |
13 | 445595a1104a4 |
14 | 1ad7b2737009c |
15 | ba51e0e5e125 |
hex | 5bf5bd4c4f5a |
101111001010010 has 32 divisors (see below), whose sum is σ = 185896805829120. Its totient is φ = 39578627918592.
The previous prime is 101111001009989. The next prime is 101111001010021. The reversal of 101111001010010 is 10010100111101.
It is a self number, because there is not a number n which added to its sum of digits gives 101111001010010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10729190 + ... + 17813969.
It is an arithmetic number, because the mean of its divisors is an integer number (5809275182160).
Almost surely, 2101111001010010 is an apocalyptic number.
101111001010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101111001010010 is a deficient number, since it is larger than the sum of its proper divisors (84785804819110).
101111001010010 is a wasteful number, since it uses less digits than its factorization.
101111001010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28550750.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 101111001010010 its reverse (10010100111101), we get a palindrome (111121101121111).
The spelling of 101111001010010 in words is "one hundred one trillion, one hundred eleven billion, one million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •