Base | Representation |
---|---|
bin | 1001000110101010100010… |
… | …0001110010111000100110 |
3 | 1022102221211011110221222022 |
4 | 2101222220201302320212 |
5 | 2303001141403344032 |
6 | 33142324345303142 |
7 | 2052130432366625 |
oct | 221525041627046 |
9 | 38387734427868 |
10 | 10010101231142 |
11 | 320a295200531 |
12 | 1158036794ab2 |
13 | 577c43aca97c |
14 | 2686c48c36bc |
15 | 1255bbb4a512 |
hex | 91aa8872e26 |
10010101231142 has 8 divisors (see below), whose sum is σ = 15805422996600. Its totient is φ = 4741626898944.
The previous prime is 10010101231139. The next prime is 10010101231183. The reversal of 10010101231142 is 24113210101001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×100101012311422 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10010101231142.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 131711858267 + ... + 131711858342.
It is an arithmetic number, because the mean of its divisors is an integer number (1975677874575).
Almost surely, 210010101231142 is an apocalyptic number.
10010101231142 is a deficient number, since it is larger than the sum of its proper divisors (5795321765458).
10010101231142 is a wasteful number, since it uses less digits than its factorization.
10010101231142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 263423716630.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 10010101231142 its reverse (24113210101001), we get a palindrome (34123311332143).
The spelling of 10010101231142 in words is "ten trillion, ten billion, one hundred one million, two hundred thirty-one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •