Base | Representation |
---|---|
bin | 1001101010110100111… |
… | …00111000000111000101 |
3 | 1011202112200100201112022 |
4 | 10311122130320013011 |
5 | 20420401340013333 |
6 | 412342505532525 |
7 | 33000653262164 |
oct | 4653234700705 |
9 | 1152480321468 |
10 | 332230001093 |
11 | 1189971a1141 |
12 | 5447b1a4145 |
13 | 254381ca983 |
14 | 121197d73db |
15 | 8996e7dc98 |
hex | 4d5a7381c5 |
332230001093 has 2 divisors, whose sum is σ = 332230001094. Its totient is φ = 332230001092.
The previous prime is 332230001071. The next prime is 332230001153. The reversal of 332230001093 is 390100032233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 219157868449 + 113072132644 = 468143^2 + 336262^2 .
It is an emirp because it is prime and its reverse (390100032233) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 332230001093 - 236 = 263510524357 is a prime.
It is a super-2 number, since 2×3322300010932 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (332230000093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166115000546 + 166115000547.
It is an arithmetic number, because the mean of its divisors is an integer number (166115000547).
Almost surely, 2332230001093 is an apocalyptic number.
It is an amenable number.
332230001093 is a deficient number, since it is larger than the sum of its proper divisors (1).
332230001093 is an equidigital number, since it uses as much as digits as its factorization.
332230001093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 26.
The spelling of 332230001093 in words is "three hundred thirty-two billion, two hundred thirty million, one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •