Base | Representation |
---|---|
bin | 1001001110001111101011… |
… | …1000110000010001000111 |
3 | 1022220101222011122111101222 |
4 | 2103203322320300101013 |
5 | 2312114344443002302 |
6 | 33322223150510555 |
7 | 2064420610562504 |
oct | 223437270602107 |
9 | 38811864574358 |
10 | 10140332000327 |
11 | 325a5440689a1 |
12 | 117932080545b |
13 | 5872c97408c9 |
14 | 270b1a8a04ab |
15 | 128b8ed94da2 |
hex | 938fae30447 |
10140332000327 has 2 divisors, whose sum is σ = 10140332000328. Its totient is φ = 10140332000326.
The previous prime is 10140332000261. The next prime is 10140332000353. The reversal of 10140332000327 is 72300023304101.
It is an a-pointer prime, because the next prime (10140332000353) can be obtained adding 10140332000327 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10140332000327 - 212 = 10140331996231 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10140332000296 and 10140332000305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140332006327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070166000163 + 5070166000164.
It is an arithmetic number, because the mean of its divisors is an integer number (5070166000164).
Almost surely, 210140332000327 is an apocalyptic number.
10140332000327 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140332000327 is an equidigital number, since it uses as much as digits as its factorization.
10140332000327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 26.
Adding to 10140332000327 its reverse (72300023304101), we get a palindrome (82440355304428).
The spelling of 10140332000327 in words is "ten trillion, one hundred forty billion, three hundred thirty-two million, three hundred twenty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •