Base | Representation |
---|---|
bin | 1000100000011011100… |
… | …1111111000010011110 |
3 | 111222020002010121112020 |
4 | 2020012321333002132 |
5 | 4343301024024044 |
6 | 151045445121010 |
7 | 13362413615340 |
oct | 2100671770236 |
9 | 458202117466 |
10 | 146144751774 |
11 | 56a859a209a |
12 | 243a76b9166 |
13 | 10a2093cba8 |
14 | 710575b290 |
15 | 3c053eda19 |
hex | 2206e7f09e |
146144751774 has 32 divisors (see below), whose sum is σ = 334162588416. Its totient is φ = 41740963200.
The previous prime is 146144751737. The next prime is 146144751787. The reversal of 146144751774 is 477157441641.
146144751774 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1461447517742 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
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, 490507 + ... + 729990.
It is an arithmetic number, because the mean of its divisors is an integer number (10442580888).
Almost surely, 2146144751774 is an apocalyptic number.
146144751774 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
146144751774 is an abundant number, since it is smaller than the sum of its proper divisors (188017836642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146144751774 is a wasteful number, since it uses less digits than its factorization.
146144751774 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1223360.
The product of its digits is 2634240, while the sum is 51.
The spelling of 146144751774 in words is "one hundred forty-six billion, one hundred forty-four million, seven hundred fifty-one thousand, seven hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •