Base | Representation |
---|---|
bin | 1000100000010101101… |
… | …0111010011101111010 |
3 | 111222011100020102102020 |
4 | 2020011122322131322 |
5 | 4343223134014440 |
6 | 151043155015310 |
7 | 13361662025304 |
oct | 2100532723572 |
9 | 458140212366 |
10 | 146119829370 |
11 | 56a7291a569 |
12 | 2439b29a536 |
13 | 10a187250c8 |
14 | 7102310974 |
15 | 3c031293d0 |
hex | 22056ba77a |
146119829370 has 32 divisors (see below), whose sum is σ = 350761102272. Its totient is φ = 38957119872.
The previous prime is 146119829369. The next prime is 146119829399. The reversal of 146119829370 is 73928911641.
146119829370 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon 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, 364312 + ... + 651891.
It is an arithmetic number, because the mean of its divisors is an integer number (10961284446).
Almost surely, 2146119829370 is an apocalyptic number.
146119829370 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
146119829370 is an abundant number, since it is smaller than the sum of its proper divisors (204641272902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146119829370 is a wasteful number, since it uses less digits than its factorization.
146119829370 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021006.
The product of its (nonzero) digits is 653184, while the sum is 51.
The spelling of 146119829370 in words is "one hundred forty-six billion, one hundred nineteen million, eight hundred twenty-nine thousand, three hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •