Base | Representation |
---|---|
bin | 101111101101000001… |
… | …1010000011000100001 |
3 | 100210102101200221120222 |
4 | 1133122003100120201 |
5 | 3134300242100213 |
6 | 115021135012425 |
7 | 10254423114101 |
oct | 1373203203041 |
9 | 323371627528 |
10 | 102442534433 |
11 | 3a49a15a3a8 |
12 | 17a2b96a115 |
13 | 987786b6a5 |
14 | 4d5b5d3201 |
15 | 29e88b3808 |
hex | 17da0d0621 |
102442534433 has 2 divisors, whose sum is σ = 102442534434. Its totient is φ = 102442534432.
The previous prime is 102442534421. The next prime is 102442534501. The reversal of 102442534433 is 334435244201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94662059584 + 7780474849 = 307672^2 + 88207^2 .
It is a cyclic number.
It is not a de Polignac number, because 102442534433 - 28 = 102442534177 is a prime.
It is a super-2 number, since 2×1024425344332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102442534393 and 102442534402.
It is not a weakly prime, because it can be changed into another prime (102472534433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51221267216 + 51221267217.
It is an arithmetic number, because the mean of its divisors is an integer number (51221267217).
Almost surely, 2102442534433 is an apocalyptic number.
It is an amenable number.
102442534433 is a deficient number, since it is larger than the sum of its proper divisors (1).
102442534433 is an equidigital number, since it uses as much as digits as its factorization.
102442534433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 138240, while the sum is 35.
Adding to 102442534433 its reverse (334435244201), we get a palindrome (436877778634).
The spelling of 102442534433 in words is "one hundred two billion, four hundred forty-two million, five hundred thirty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.228 sec. • engine limits •