Base | Representation |
---|---|
bin | 1001001100000100111111… |
… | …0011111101001101001101 |
3 | 1022202211212120000121200211 |
4 | 2103001033303331031031 |
5 | 2311012123114202201 |
6 | 33253145004522421 |
7 | 2061632200626100 |
oct | 223011763751515 |
9 | 38684776017624 |
10 | 10103102100301 |
11 | 3245779825a81 |
12 | 1172070550411 |
13 | 583945549c72 |
14 | 26cdc8172737 |
15 | 127c1168d651 |
hex | 9304fcfd34d |
10103102100301 has 6 divisors (see below), whose sum is σ = 11752588157550. Its totient is φ = 8659801800216.
The previous prime is 10103102100269. The next prime is 10103102100313. The reversal of 10103102100301 is 10300120130101.
It can be written as a sum of positive squares in only one way, i.e., 9456541372201 + 646560728100 = 3075149^2 + 804090^2 .
It is not a de Polignac number, because 10103102100301 - 25 = 10103102100269 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10103102100001) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 103092878526 + ... + 103092878623.
It is an arithmetic number, because the mean of its divisors is an integer number (1958764692925).
Almost surely, 210103102100301 is an apocalyptic number.
It is an amenable number.
10103102100301 is a deficient number, since it is larger than the sum of its proper divisors (1649486057249).
10103102100301 is an equidigital number, since it uses as much as digits as its factorization.
10103102100301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206185757163 (or 206185757156 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 10103102100301 its reverse (10300120130101), we get a palindrome (20403222230402).
The spelling of 10103102100301 in words is "ten trillion, one hundred three billion, one hundred two million, one hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •