Base | Representation |
---|---|
bin | 1000100011011001110… |
… | …1001110001011100110 |
3 | 112001021200021100001010 |
4 | 2020312131032023212 |
5 | 4401414241033430 |
6 | 151300544043050 |
7 | 13421241536352 |
oct | 2106635161346 |
9 | 461250240033 |
10 | 146942517990 |
11 | 57355247714 |
12 | 2458a903486 |
13 | 10b19cc00c8 |
14 | 717d6a4462 |
15 | 3c50483cb0 |
hex | 223674e2e6 |
146942517990 has 32 divisors (see below), whose sum is σ = 367995177216. Its totient is φ = 37480989920.
The previous prime is 146942517983. The next prime is 146942518001. The reversal of 146942517990 is 99715249641.
It is a happy number.
146942517990 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 146942517990.
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 15 ways as a sum of consecutive naturals, for example, 106479396 + ... + 106480775.
It is an arithmetic number, because the mean of its divisors is an integer number (11499849288).
Almost surely, 2146942517990 is an apocalyptic number.
146942517990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146942517990 is an abundant number, since it is smaller than the sum of its proper divisors (221052659226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146942517990 is a wasteful number, since it uses less digits than its factorization.
146942517990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212960204.
The product of its (nonzero) digits is 4898880, while the sum is 57.
The spelling of 146942517990 in words is "one hundred forty-six billion, nine hundred forty-two million, five hundred seventeen thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •