Base | Representation |
---|---|
bin | 1001000110101110011100… |
… | …1000000100111110001101 |
3 | 1022110001112100122211000122 |
4 | 2101223213020010332031 |
5 | 2303010314233012333 |
6 | 33143020503234325 |
7 | 2052165444214256 |
oct | 221534710047615 |
9 | 38401470584018 |
10 | 10011151454093 |
11 | 320a784007589 |
12 | 115828a4489a5 |
13 | 57808057087a |
14 | 268784185b2d |
15 | 12562de4c798 |
hex | 91ae7204f8d |
10011151454093 has 2 divisors, whose sum is σ = 10011151454094. Its totient is φ = 10011151454092.
The previous prime is 10011151454041. The next prime is 10011151454113. The reversal of 10011151454093 is 39045415111001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8459238459529 + 1551912994564 = 2908477^2 + 1245758^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011151454093 - 214 = 10011151437709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011151457093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005575727046 + 5005575727047.
It is an arithmetic number, because the mean of its divisors is an integer number (5005575727047).
Almost surely, 210011151454093 is an apocalyptic number.
It is an amenable number.
10011151454093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011151454093 is an equidigital number, since it uses as much as digits as its factorization.
10011151454093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 35.
Adding to 10011151454093 its reverse (39045415111001), we get a palindrome (49056566565094).
The spelling of 10011151454093 in words is "ten trillion, eleven billion, one hundred fifty-one million, four hundred fifty-four thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •