Base | Representation |
---|---|
bin | 1001001000110001110111… |
… | …1010001111001010000001 |
3 | 1022120102121000001102210001 |
4 | 2102030131322033022001 |
5 | 2304100042124423131 |
6 | 33211133311440001 |
7 | 2054554623440515 |
oct | 222143572171201 |
9 | 38512530042701 |
10 | 10046430311041 |
11 | 3223738000a03 |
12 | 1163095226001 |
13 | 57b4b349b857 |
14 | 26a36d720145 |
15 | 1264e6212261 |
hex | 9231de8f281 |
10046430311041 has 2 divisors, whose sum is σ = 10046430311042. Its totient is φ = 10046430311040.
The previous prime is 10046430311003. The next prime is 10046430311069. The reversal of 10046430311041 is 14011303464001.
It is an a-pointer prime, because the next prime (10046430311069) can be obtained adding 10046430311041 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9756383437441 + 290046873600 = 3123521^2 + 538560^2 .
It is a cyclic number.
It is not a de Polignac number, because 10046430311041 - 27 = 10046430310913 is a prime.
It is not a weakly prime, because it can be changed into another prime (10046430311641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5023215155520 + 5023215155521.
It is an arithmetic number, because the mean of its divisors is an integer number (5023215155521).
Almost surely, 210046430311041 is an apocalyptic number.
It is an amenable number.
10046430311041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10046430311041 is an equidigital number, since it uses as much as digits as its factorization.
10046430311041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 10046430311041 its reverse (14011303464001), we get a palindrome (24057733775042).
The spelling of 10046430311041 in words is "ten trillion, forty-six billion, four hundred thirty million, three hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •