Base | Representation |
---|---|
bin | 1000100011010101011… |
… | …1011100011011110101 |
3 | 112001020101212000112212 |
4 | 2020311113130123311 |
5 | 4401400100220133 |
6 | 151255052023205 |
7 | 13420630213655 |
oct | 2106527343365 |
9 | 461211760485 |
10 | 146924226293 |
11 | 57345993909 |
12 | 24584761b05 |
13 | 10b16287410 |
14 | 717b0a2365 |
15 | 3c4da6e148 |
hex | 22355dc6f5 |
146924226293 has 4 divisors (see below), whose sum is σ = 158226089868. Its totient is φ = 135622362720.
The previous prime is 146924226287. The next prime is 146924226311. The reversal of 146924226293 is 392622429641.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 97330272484 + 49593953809 = 311978^2 + 222697^2 .
It is not a de Polignac number, because 146924226293 - 28 = 146924226037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146924226263) 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, 5650931768 + ... + 5650931793.
It is an arithmetic number, because the mean of its divisors is an integer number (39556522467).
Almost surely, 2146924226293 is an apocalyptic number.
146924226293 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
146924226293 is a deficient number, since it is larger than the sum of its proper divisors (11301863575).
146924226293 is a wasteful number, since it uses less digits than its factorization.
146924226293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11301863574.
The product of its digits is 2239488, while the sum is 50.
The spelling of 146924226293 in words is "one hundred forty-six billion, nine hundred twenty-four million, two hundred twenty-six thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •