Base | Representation |
---|---|
bin | 111010100010111011011… |
… | …011111001100100010101 |
3 | 112020121200002122022222011 |
4 | 322202323123321210111 |
5 | 1011404040403322013 |
6 | 12320125340104221 |
7 | 563445330052225 |
oct | 72427333714425 |
9 | 15217602568864 |
10 | 4023234042133 |
11 | 1311275805389 |
12 | 54b890b35071 |
13 | 23250a500967 |
14 | dca22d52085 |
15 | 6e9c0aeac3d |
hex | 3a8bb6f9915 |
4023234042133 has 2 divisors, whose sum is σ = 4023234042134. Its totient is φ = 4023234042132.
The previous prime is 4023234042101. The next prime is 4023234042209. The reversal of 4023234042133 is 3312404323204.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2984124961444 + 1039109080689 = 1727462^2 + 1019367^2 .
It is a cyclic number.
It is not a de Polignac number, because 4023234042133 - 25 = 4023234042101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4023234042095 and 4023234042104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4023234048133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011617021066 + 2011617021067.
It is an arithmetic number, because the mean of its divisors is an integer number (2011617021067).
Almost surely, 24023234042133 is an apocalyptic number.
It is an amenable number.
4023234042133 is a deficient number, since it is larger than the sum of its proper divisors (1).
4023234042133 is an equidigital number, since it uses as much as digits as its factorization.
4023234042133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 4023234042133 its reverse (3312404323204), we get a palindrome (7335638365337).
The spelling of 4023234042133 in words is "four trillion, twenty-three billion, two hundred thirty-four million, forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •