Base | Representation |
---|---|
bin | 111100010101010… |
… | …110100100100001 |
3 | 2121112200122010001 |
4 | 330111112210201 |
5 | 4033112333213 |
6 | 244235340001 |
7 | 34040550064 |
oct | 7425264441 |
9 | 2545618101 |
10 | 1012230433 |
11 | 47a417785 |
12 | 242bb1601 |
13 | 131930026 |
14 | 986128db |
15 | 5dcea1dd |
hex | 3c556921 |
1012230433 has 2 divisors, whose sum is σ = 1012230434. Its totient is φ = 1012230432.
The previous prime is 1012230409. The next prime is 1012230451. The reversal of 1012230433 is 3340322101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 578258209 + 433972224 = 24047^2 + 20832^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012230433 - 221 = 1010133281 is a prime.
It is a super-2 number, since 2×10122304332 = 2049220898982734978, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1012230433.
It is not a weakly prime, because it can be changed into another prime (1012233433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506115216 + 506115217.
It is an arithmetic number, because the mean of its divisors is an integer number (506115217).
Almost surely, 21012230433 is an apocalyptic number.
It is an amenable number.
1012230433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012230433 is an equidigital number, since it uses as much as digits as its factorization.
1012230433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 1012230433 is about 31815.5690346723. The cubic root of 1012230433 is about 1004.0603026298.
Adding to 1012230433 its reverse (3340322101), we get a palindrome (4352552534).
The spelling of 1012230433 in words is "one billion, twelve million, two hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •