Base | Representation |
---|---|
bin | 1000100000010010111… |
… | …1010100100101001000 |
3 | 111222010112201212000000 |
4 | 2020010233110211020 |
5 | 4343212222330432 |
6 | 151042110043000 |
7 | 13361462632320 |
oct | 2100457244510 |
9 | 458115655000 |
10 | 146108401992 |
11 | 56a67424a53 |
12 | 243974a9460 |
13 | 10a16253947 |
14 | 71009b8280 |
15 | 3c0211d57c |
hex | 2204bd4948 |
146108401992 has 224 divisors, whose sum is σ = 470136199680. Its totient is φ = 41681537280.
The previous prime is 146108401979. The next prime is 146108402009. The reversal of 146108401992 is 299104801641.
It is a happy number.
146108401992 is a `hidden beast` number, since 14 + 610 + 8 + 4 + 0 + 19 + 9 + 2 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 31064713 + ... + 31069415.
It is an arithmetic number, because the mean of its divisors is an integer number (2098822320).
Almost surely, 2146108401992 is an apocalyptic number.
146108401992 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146108401992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (235068099840).
146108401992 is an abundant number, since it is smaller than the sum of its proper divisors (324027797688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146108401992 is an equidigital number, since it uses as much as digits as its factorization.
146108401992 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5495 (or 5476 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 45.
The spelling of 146108401992 in words is "one hundred forty-six billion, one hundred eight million, four hundred one thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •