Base | Representation |
---|---|
bin | 10001011011110… |
… | …00010110101001 |
3 | 101012012000110201 |
4 | 20231320112221 |
5 | 244414320113 |
6 | 22302312201 |
7 | 3424030234 |
oct | 1055702651 |
9 | 335160421 |
10 | 146245033 |
11 | 75608070 |
12 | 40b88661 |
13 | 243b5a2c |
14 | 155cc41b |
15 | cc8bcdd |
hex | 8b785a9 |
146245033 has 16 divisors (see below), whose sum is σ = 177819840. Its totient is φ = 118540800.
The previous prime is 146245007. The next prime is 146245049. The reversal of 146245033 is 330542641.
146245033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 146245033 - 213 = 146236841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 146244992 and 146245010.
It is not an unprimeable number, because it can be changed into a prime (146245003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17028 + ... + 24133.
It is an arithmetic number, because the mean of its divisors is an integer number (11113740).
Almost surely, 2146245033 is an apocalyptic number.
It is an amenable number.
146245033 is a deficient number, since it is larger than the sum of its proper divisors (31574807).
146245033 is a wasteful number, since it uses less digits than its factorization.
With its successor (146245034) it forms an eRAP, since the sums of their prime factors are consecutive (41208 and 41209).
146245033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41208.
The product of its (nonzero) digits is 8640, while the sum is 28.
The square root of 146245033 is about 12093.1812605286. The cubic root of 146245033 is about 526.8581569251.
Adding to 146245033 its reverse (330542641), we get a palindrome (476787674).
The spelling of 146245033 in words is "one hundred forty-six million, two hundred forty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •