Base | Representation |
---|---|
bin | 11101011111001111010… |
… | …11011010100011110001 |
3 | 10120212020221111221011201 |
4 | 32233213223122203301 |
5 | 113100020240414213 |
6 | 2053243135011201 |
7 | 133126100606341 |
oct | 16574753324361 |
9 | 3525227457151 |
10 | 1013204232433 |
11 | 360774414188 |
12 | 144448069b01 |
13 | 74710a77123 |
14 | 37079d76d21 |
15 | 1b550aab6dd |
hex | ebe7ada8f1 |
1013204232433 has 2 divisors, whose sum is σ = 1013204232434. Its totient is φ = 1013204232432.
The previous prime is 1013204232379. The next prime is 1013204232479. The reversal of 1013204232433 is 3342324023101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 705082654864 + 308121577569 = 839692^2 + 555087^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013204232433 - 225 = 1013170678001 is a prime.
It is a super-3 number, since 3×10132042324333 (a number of 37 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (1013204232493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506602116216 + 506602116217.
It is an arithmetic number, because the mean of its divisors is an integer number (506602116217).
Almost surely, 21013204232433 is an apocalyptic number.
It is an amenable number.
1013204232433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013204232433 is an equidigital number, since it uses as much as digits as its factorization.
1013204232433 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 28.
Adding to 1013204232433 its reverse (3342324023101), we get a palindrome (4355528255534).
The spelling of 1013204232433 in words is "one trillion, thirteen billion, two hundred four million, two hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •