Base | Representation |
---|---|
bin | 1001001100000101101110… |
… | …0110111001010010111001 |
3 | 1022202212101100102010011110 |
4 | 2103001123212321102321 |
5 | 2311013024300044001 |
6 | 33253220354350533 |
7 | 2061640123026642 |
oct | 223013346712271 |
9 | 38685340363143 |
10 | 10103300003001 |
11 | 3245870506227 |
12 | 117210688b449 |
13 | 58397754b75a |
14 | 26d00656a6c9 |
15 | 127c23c313d6 |
hex | 9305b9b94b9 |
10103300003001 has 16 divisors (see below), whose sum is σ = 13481205865920. Its totient is φ = 6730464153600.
The previous prime is 10103300002981. The next prime is 10103300003021. The reversal of 10103300003001 is 10030000330101.
10103300003001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10103300002981) and next prime (10103300003021).
It is not a de Polignac number, because 10103300003001 - 29 = 10103300002489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10103300003021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 151297446 + ... + 151364208.
It is an arithmetic number, because the mean of its divisors is an integer number (842575366620).
Almost surely, 210103300003001 is an apocalyptic number.
It is an amenable number.
10103300003001 is a deficient number, since it is larger than the sum of its proper divisors (3377905862919).
10103300003001 is a wasteful number, since it uses less digits than its factorization.
10103300003001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103976.
The product of its (nonzero) digits is 27, while the sum is 12.
Adding to 10103300003001 its reverse (10030000330101), we get a palindrome (20133300333102).
The spelling of 10103300003001 in words is "ten trillion, one hundred three billion, three hundred million, three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •