Base | Representation |
---|---|
bin | 1001000111110100110001… |
… | …1111110001001001100001 |
3 | 1022111212021011210120022221 |
4 | 2101331030133301021201 |
5 | 2303313001200013403 |
6 | 33155422203431041 |
7 | 2053434354405034 |
oct | 221751437611141 |
9 | 38455234716287 |
10 | 10030032032353 |
11 | 3217792666473 |
12 | 115ba79525481 |
13 | 579a9c057678 |
14 | 26965591501b |
15 | 125d86797dbd |
hex | 91f4c7f1261 |
10030032032353 has 2 divisors, whose sum is σ = 10030032032354. Its totient is φ = 10030032032352.
The previous prime is 10030032032287. The next prime is 10030032032389. The reversal of 10030032032353 is 35323023003001.
It is a happy number.
10030032032353 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9058372342369 + 971659689984 = 3009713^2 + 985728^2 .
It is a cyclic number.
It is not a de Polignac number, because 10030032032353 - 225 = 10029998477921 is a prime.
It is not a weakly prime, because it can be changed into another prime (10030032033353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5015016016176 + 5015016016177.
It is an arithmetic number, because the mean of its divisors is an integer number (5015016016177).
Almost surely, 210030032032353 is an apocalyptic number.
It is an amenable number.
10030032032353 is a deficient number, since it is larger than the sum of its proper divisors (1).
10030032032353 is an equidigital number, since it uses as much as digits as its factorization.
10030032032353 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4860, while the sum is 25.
Adding to 10030032032353 its reverse (35323023003001), we get a palindrome (45353055035354).
The spelling of 10030032032353 in words is "ten trillion, thirty billion, thirty-two million, thirty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •