Base | Representation |
---|---|
bin | 1000011111111010000… |
… | …1100011100110110101 |
3 | 111221212021112022000212 |
4 | 2013332201203212311 |
5 | 4343004024131404 |
6 | 151023503115205 |
7 | 13356055426106 |
oct | 2077641434665 |
9 | 457767468025 |
10 | 146004130229 |
11 | 56a13586041 |
12 | 243685a2b05 |
13 | 109ca775989 |
14 | 70d0bd43ad |
15 | 3be7dc306e |
hex | 21fe8639b5 |
146004130229 has 2 divisors, whose sum is σ = 146004130230. Its totient is φ = 146004130228.
The previous prime is 146004130171. The next prime is 146004130331. The reversal of 146004130229 is 922031400641.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 122594518225 + 23409612004 = 350135^2 + 153002^2 .
It is a cyclic number.
It is not a de Polignac number, because 146004130229 - 224 = 145987353013 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 146004130195 and 146004130204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146004132229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73002065114 + 73002065115.
It is an arithmetic number, because the mean of its divisors is an integer number (73002065115).
Almost surely, 2146004130229 is an apocalyptic number.
It is an amenable number.
146004130229 is a deficient number, since it is larger than the sum of its proper divisors (1).
146004130229 is an equidigital number, since it uses as much as digits as its factorization.
146004130229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 146004130229 in words is "one hundred forty-six billion, four million, one hundred thirty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.164 sec. • engine limits •