Base | Representation |
---|---|
bin | 10001011111011… |
… | …11101100010001 |
3 | 101020002211222201 |
4 | 20233233230101 |
5 | 300030440331 |
6 | 22321003201 |
7 | 3431134312 |
oct | 1057575421 |
9 | 336084881 |
10 | 146733841 |
11 | 75911341 |
12 | 41183501 |
13 | 24527377 |
14 | 156b8609 |
15 | cd36a61 |
hex | 8befb11 |
146733841 has 4 divisors (see below), whose sum is σ = 146779632. Its totient is φ = 146688052.
The previous prime is 146733809. The next prime is 146733857. The reversal of 146733841 is 148337641.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 146733841 - 25 = 146733809 is a prime.
It is a super-2 number, since 2×1467338412 = 43061640189226562, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 146733841.
It is not an unprimeable number, because it can be changed into a prime (146733871) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17695 + ... + 24628.
It is an arithmetic number, because the mean of its divisors is an integer number (36694908).
Almost surely, 2146733841 is an apocalyptic number.
It is an amenable number.
146733841 is a deficient number, since it is larger than the sum of its proper divisors (45791).
146733841 is an equidigital number, since it uses as much as digits as its factorization.
146733841 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45790.
The product of its digits is 48384, while the sum is 37.
The square root of 146733841 is about 12113.3744679177. The cubic root of 146733841 is about 527.4444927106. Note that the first 4 decimals are identical.
The spelling of 146733841 in words is "one hundred forty-six million, seven hundred thirty-three thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •