Base | Representation |
---|---|
bin | 1000100000000011101… |
… | …0000001111011100111 |
3 | 111221222001201222200212 |
4 | 2020000322001323213 |
5 | 4343044242202302 |
6 | 151031451530035 |
7 | 13360052241026 |
oct | 2100072017347 |
9 | 457861658625 |
10 | 146044100327 |
11 | 56a340a6184 |
12 | 24379a5991b |
13 | 10a05b2ba18 |
14 | 70d623a8bd |
15 | 3beb66b052 |
hex | 2200e81ee7 |
146044100327 has 8 divisors (see below), whose sum is σ = 155310195600. Its totient is φ = 136853034624.
The previous prime is 146044100317. The next prime is 146044100329. The reversal of 146044100327 is 723001440641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146044100327 - 28 = 146044100071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146044100293 and 146044100302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146044100329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18753377 + ... + 18761162.
It is an arithmetic number, because the mean of its divisors is an integer number (19413774450).
Almost surely, 2146044100327 is an apocalyptic number.
146044100327 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
146044100327 is a deficient number, since it is larger than the sum of its proper divisors (9266095273).
146044100327 is a wasteful number, since it uses less digits than its factorization.
146044100327 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37514785.
The product of its (nonzero) digits is 16128, while the sum is 32.
Adding to 146044100327 its reverse (723001440641), we get a palindrome (869045540968).
The spelling of 146044100327 in words is "one hundred forty-six billion, forty-four million, one hundred thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •