Base | Representation |
---|---|
bin | 111010100010101110000… |
… | …110011110101011111101 |
3 | 112020121002111200020021122 |
4 | 322202232012132223331 |
5 | 1011403111120320242 |
6 | 12320051225040325 |
7 | 563436642346355 |
oct | 72425606365375 |
9 | 15217074606248 |
10 | 4023010323197 |
11 | 13111704a1aa8 |
12 | 54b82a0260a5 |
13 | 2324a30605a8 |
14 | dca01357b65 |
15 | 6e9ab158ad2 |
hex | 3a8ae19eafd |
4023010323197 has 2 divisors, whose sum is σ = 4023010323198. Its totient is φ = 4023010323196.
The previous prime is 4023010323193. The next prime is 4023010323217. The reversal of 4023010323197 is 7913230103204.
4023010323197 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2954586269881 + 1068424053316 = 1718891^2 + 1033646^2 .
It is a cyclic number.
It is not a de Polignac number, because 4023010323197 - 22 = 4023010323193 is a prime.
It is a super-2 number, since 2×40230103231972 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4023010323193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011505161598 + 2011505161599.
It is an arithmetic number, because the mean of its divisors is an integer number (2011505161599).
Almost surely, 24023010323197 is an apocalyptic number.
It is an amenable number.
4023010323197 is a deficient number, since it is larger than the sum of its proper divisors (1).
4023010323197 is an equidigital number, since it uses as much as digits as its factorization.
4023010323197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 35.
The spelling of 4023010323197 in words is "four trillion, twenty-three billion, ten million, three hundred twenty-three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •