Base | Representation |
---|---|
bin | 10111011110001110100000… |
… | …100110001101110100010101 |
3 | 111112111220102211120102010221 |
4 | 113132032200212031310111 |
5 | 102012324103213110424 |
6 | 1003320122220314341 |
7 | 30513165656145226 |
oct | 2736164046156425 |
9 | 445456384512127 |
10 | 103232233331989 |
11 | 2a9905a95034a3 |
12 | b6b31220a29b1 |
13 | 457a9b0c5c208 |
14 | 1b6c676aab24d |
15 | be04921b49e4 |
hex | 5de3a098dd15 |
103232233331989 has 2 divisors, whose sum is σ = 103232233331990. Its totient is φ = 103232233331988.
The previous prime is 103232233331971. The next prime is 103232233332037. The reversal of 103232233331989 is 989133332232301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72976271038225 + 30255962293764 = 8542615^2 + 5500542^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103232233331989 is a prime.
It is a super-2 number, since 2×1032322333319892 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103232233331939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51616116665994 + 51616116665995.
It is an arithmetic number, because the mean of its divisors is an integer number (51616116665995).
Almost surely, 2103232233331989 is an apocalyptic number.
It is an amenable number.
103232233331989 is a deficient number, since it is larger than the sum of its proper divisors (1).
103232233331989 is an equidigital number, since it uses as much as digits as its factorization.
103232233331989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3779136, while the sum is 52.
The spelling of 103232233331989 in words is "one hundred three trillion, two hundred thirty-two billion, two hundred thirty-three million, three hundred thirty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •