Base | Representation |
---|---|
bin | 100000110110101… |
… | …1010010110001001 |
3 | 2211211101220122112 |
4 | 1001231122112021 |
5 | 4224210022213 |
6 | 301220432105 |
7 | 36214305326 |
oct | 10155322611 |
9 | 2754356575 |
10 | 1102423433 |
11 | 516320051 |
12 | 269248635 |
13 | 14751ba77 |
14 | a65adb4d |
15 | 66bb3ea8 |
hex | 41b5a589 |
1102423433 has 4 divisors (see below), whose sum is σ = 1116378240. Its totient is φ = 1088468628.
The previous prime is 1102423417. The next prime is 1102423447. The reversal of 1102423433 is 3343242011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1102423433 - 24 = 1102423417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102423399 and 1102423408.
It is not an unprimeable number, because it can be changed into a prime (1102425433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6977285 + ... + 6977442.
It is an arithmetic number, because the mean of its divisors is an integer number (279094560).
Almost surely, 21102423433 is an apocalyptic number.
It is an amenable number.
1102423433 is a deficient number, since it is larger than the sum of its proper divisors (13954807).
1102423433 is an equidigital number, since it uses as much as digits as its factorization.
1102423433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13954806.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 1102423433 is about 33202.7624302557. The cubic root of 1102423433 is about 1033.0376387254.
Adding to 1102423433 its reverse (3343242011), we get a palindrome (4445665444).
The spelling of 1102423433 in words is "one billion, one hundred two million, four hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •