Base | Representation |
---|---|
bin | 100001010101110000110111… |
… | …010000010100100000110010 |
3 | 201020011210112012112211120112 |
4 | 201111300313100110200302 |
5 | 123204401003242320032 |
6 | 1235505222514341322 |
7 | 42612514416444422 |
oct | 4125606720244062 |
9 | 636153465484515 |
10 | 146631110510642 |
11 | 427a29a524430a |
12 | 1454211228a842 |
13 | 63a833cb83874 |
14 | 282cdab082482 |
15 | 11e432967b1b2 |
hex | 855c37414832 |
146631110510642 has 16 divisors (see below), whose sum is σ = 220068987415200. Its totient is φ = 73274785140960.
The previous prime is 146631110510537. The next prime is 146631110510713. The reversal of 146631110510642 is 246015011136641.
It is a self number, because there is not a number n which added to its sum of digits gives 146631110510642.
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 7 ways as a sum of consecutive naturals, for example, 77797334 + ... + 79659822.
It is an arithmetic number, because the mean of its divisors is an integer number (13754311713450).
Almost surely, 2146631110510642 is an apocalyptic number.
146631110510642 is a deficient number, since it is larger than the sum of its proper divisors (73437876904558).
146631110510642 is a wasteful number, since it uses less digits than its factorization.
146631110510642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1884361.
The product of its (nonzero) digits is 103680, while the sum is 41.
The spelling of 146631110510642 in words is "one hundred forty-six trillion, six hundred thirty-one billion, one hundred ten million, five hundred ten thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •