Base | Representation |
---|---|
bin | 1000100000010101111… |
… | …0111010010111101100 |
3 | 111222011102012200020122 |
4 | 2020011132322113230 |
5 | 4343223421040143 |
6 | 151043233304112 |
7 | 13362003652232 |
oct | 2100536722754 |
9 | 458142180218 |
10 | 146120877548 |
11 | 56a73476028 |
12 | 2439b705038 |
13 | 10a18a01229 |
14 | 7102504952 |
15 | 3c03284c68 |
hex | 22057ba5ec |
146120877548 has 12 divisors (see below), whose sum is σ = 255716059872. Its totient is φ = 73059146160.
The previous prime is 146120877547. The next prime is 146120877611. The reversal of 146120877548 is 845778021641.
146120877548 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1461208775482 (a number of 23 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 146120877548.
It is not an unprimeable number, because it can be changed into a prime (146120877547) by changing a digit.
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, 41540 + ... + 542187.
It is an arithmetic number, because the mean of its divisors is an integer number (21309671656).
Almost surely, 2146120877548 is an apocalyptic number.
It is an amenable number.
146120877548 is a deficient number, since it is larger than the sum of its proper divisors (109595182324).
146120877548 is a wasteful number, since it uses less digits than its factorization.
146120877548 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 646312 (or 646310 counting only the distinct ones).
The product of its (nonzero) digits is 3010560, while the sum is 53.
The spelling of 146120877548 in words is "one hundred forty-six billion, one hundred twenty million, eight hundred seventy-seven thousand, five hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •