Base | Representation |
---|---|
bin | 1001011001010011000111… |
… | …0001001011100110100111 |
3 | 1100120120010120201121111212 |
4 | 2112110301301023212213 |
5 | 2323222303204314142 |
6 | 33545350500222035 |
7 | 2114222522312006 |
oct | 226246161134647 |
9 | 40516116647455 |
10 | 10330231323047 |
11 | 3323032300819 |
12 | 11aa09969a91b |
13 | 59c1a125275c |
14 | 279db32d2c3d |
15 | 12daa66c0d82 |
hex | 96531c4b9a7 |
10330231323047 has 2 divisors, whose sum is σ = 10330231323048. Its totient is φ = 10330231323046.
The previous prime is 10330231322987. The next prime is 10330231323077. The reversal of 10330231323047 is 74032313203301.
10330231323047 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 is a cyclic number.
It is not a de Polignac number, because 10330231323047 - 210 = 10330231322023 is a prime.
It is a super-2 number, since 2×103302313230472 (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 (10330231323077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165115661523 + 5165115661524.
It is an arithmetic number, because the mean of its divisors is an integer number (5165115661524).
Almost surely, 210330231323047 is an apocalyptic number.
10330231323047 is a deficient number, since it is larger than the sum of its proper divisors (1).
10330231323047 is an equidigital number, since it uses as much as digits as its factorization.
10330231323047 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27216, while the sum is 32.
Adding to 10330231323047 its reverse (74032313203301), we get a palindrome (84362544526348).
The spelling of 10330231323047 in words is "ten trillion, three hundred thirty billion, two hundred thirty-one million, three hundred twenty-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •