Base | Representation |
---|---|
bin | 1001010011100010100100… |
… | …0100011101010000010011 |
3 | 1100020002202222010021002021 |
4 | 2110320221010131100103 |
5 | 2320112201042231311 |
6 | 33432110031032311 |
7 | 2104121115500635 |
oct | 224705104352023 |
9 | 40202688107067 |
10 | 10231301133331 |
11 | 329508583aa53 |
12 | 1192a8a06b697 |
13 | 592a66283565 |
14 | 2752aa392a55 |
15 | 12b216357171 |
hex | 94e2911d413 |
10231301133331 has 2 divisors, whose sum is σ = 10231301133332. Its totient is φ = 10231301133330.
The previous prime is 10231301133301. The next prime is 10231301133371. The reversal of 10231301133331 is 13333110313201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10231301133331 - 227 = 10231166915603 is a prime.
It is a super-3 number, since 3×102313011333313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 10231301133296 and 10231301133305.
It is not a weakly prime, because it can be changed into another prime (10231301133301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5115650566665 + 5115650566666.
It is an arithmetic number, because the mean of its divisors is an integer number (5115650566666).
Almost surely, 210231301133331 is an apocalyptic number.
10231301133331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10231301133331 is an equidigital number, since it uses as much as digits as its factorization.
10231301133331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 10231301133331 its reverse (13333110313201), we get a palindrome (23564411446532).
The spelling of 10231301133331 in words is "ten trillion, two hundred thirty-one billion, three hundred one million, one hundred thirty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •