Base | Representation |
---|---|
bin | 11111110101100101110000… |
… | …011000111110001000000010 |
3 | 200100202222112220102000110211 |
4 | 133311211300120332020002 |
5 | 121323110242242123020 |
6 | 1213445134335344334 |
7 | 41331156345500416 |
oct | 3765456030761002 |
9 | 610688486360424 |
10 | 140022114411010 |
11 | 40685055241587 |
12 | 138552829820aa |
13 | 601904b1806c0 |
14 | 268116c330d46 |
15 | 112c46abb985a |
hex | 7f597063e202 |
140022114411010 has 32 divisors (see below), whose sum is σ = 283228678252800. Its totient is φ = 49452626359488.
The previous prime is 140022114410999. The next prime is 140022114411013. The reversal of 140022114411010 is 10114411220041.
It is not an unprimeable number, because it can be changed into a prime (140022114411013) 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 15 ways as a sum of consecutive naturals, for example, 23415066310 + ... + 23415072289.
It is an arithmetic number, because the mean of its divisors is an integer number (8850896195400).
Almost surely, 2140022114411010 is an apocalyptic number.
140022114411010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
140022114411010 is an abundant number, since it is smaller than the sum of its proper divisors (143206563841790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140022114411010 is a wasteful number, since it uses less digits than its factorization.
140022114411010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46830138642.
The product of its (nonzero) digits is 256, while the sum is 22.
Adding to 140022114411010 its reverse (10114411220041), we get a palindrome (150136525631051).
The spelling of 140022114411010 in words is "one hundred forty trillion, twenty-two billion, one hundred fourteen million, four hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •