Base | Representation |
---|---|
bin | 1001011111001110010110… |
… | …0000001011100111111101 |
3 | 1100221021220011210200202211 |
4 | 2113303211200023213331 |
5 | 2331404244414411443 |
6 | 34104224153020421 |
7 | 2124455311355044 |
oct | 227634540134775 |
9 | 40837804720684 |
10 | 10432031013373 |
11 | 33622215a98a2 |
12 | 120596a0b4711 |
13 | 5a89758742c8 |
14 | 280cad38955b |
15 | 13156390219d |
hex | 97ce580b9fd |
10432031013373 has 2 divisors, whose sum is σ = 10432031013374. Its totient is φ = 10432031013372.
The previous prime is 10432031013307. The next prime is 10432031013403. The reversal of 10432031013373 is 37331013023401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8492077889689 + 1939953123684 = 2914117^2 + 1392822^2 .
It is a cyclic number.
It is not a de Polignac number, because 10432031013373 - 213 = 10432031005181 is a prime.
It is a super-2 number, since 2×104320310133732 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10432031011373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5216015506686 + 5216015506687.
It is an arithmetic number, because the mean of its divisors is an integer number (5216015506687).
Almost surely, 210432031013373 is an apocalyptic number.
It is an amenable number.
10432031013373 is a deficient number, since it is larger than the sum of its proper divisors (1).
10432031013373 is an equidigital number, since it uses as much as digits as its factorization.
10432031013373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 31.
Adding to 10432031013373 its reverse (37331013023401), we get a palindrome (47763044036774).
The spelling of 10432031013373 in words is "ten trillion, four hundred thirty-two billion, thirty-one million, thirteen thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •