Base | Representation |
---|---|
bin | 1001001100000101000011… |
… | …1100000101111010010001 |
3 | 1022202211220212121100100221 |
4 | 2103001100330011322101 |
5 | 2311012142434312241 |
6 | 33253150522113041 |
7 | 2061632520435253 |
oct | 223012074057221 |
9 | 38684825540327 |
10 | 10103121010321 |
11 | 3245789471399 |
12 | 117207694b781 |
13 | 58394943b221 |
14 | 26cdca895cd3 |
15 | 127c131765d1 |
hex | 93050f05e91 |
10103121010321 has 2 divisors, whose sum is σ = 10103121010322. Its totient is φ = 10103121010320.
The previous prime is 10103121010303. The next prime is 10103121010369. The reversal of 10103121010321 is 12301012130101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7302398267025 + 2800722743296 = 2702295^2 + 1673536^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103121010321 - 25 = 10103121010289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10103121010295 and 10103121010304.
It is not a weakly prime, because it can be changed into another prime (10103121410321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051560505160 + 5051560505161.
It is an arithmetic number, because the mean of its divisors is an integer number (5051560505161).
Almost surely, 210103121010321 is an apocalyptic number.
It is an amenable number.
10103121010321 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103121010321 is an equidigital number, since it uses as much as digits as its factorization.
10103121010321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 10103121010321 its reverse (12301012130101), we get a palindrome (22404133140422).
The spelling of 10103121010321 in words is "ten trillion, one hundred three billion, one hundred twenty-one million, ten thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •