Base | Representation |
---|---|
bin | 1001010001110001101100… |
… | …0111100101111010000001 |
3 | 1100010012120101112012201000 |
4 | 2110130123013211322001 |
5 | 2314113123042144410 |
6 | 33410135322002213 |
7 | 2101666226623635 |
oct | 224343307457201 |
9 | 40105511465630 |
10 | 10201002303105 |
11 | 3283247951399 |
12 | 1189033046369 |
13 | 58cc4800cc53 |
14 | 273a3439adc5 |
15 | 12a5413a0dc0 |
hex | 9471b1e5e81 |
10201002303105 has 32 divisors (see below), whose sum is σ = 18176052366720. Its totient is φ = 5428253413440.
The previous prime is 10201002303101. The next prime is 10201002303127. The reversal of 10201002303105 is 50130320010201.
10201002303105 is a `hidden beast` number, since 1 + 0 + 20 + 100 + 230 + 310 + 5 = 666.
It is not a de Polignac number, because 10201002303105 - 22 = 10201002303101 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10201002303101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 85225726 + ... + 85345335.
It is an arithmetic number, because the mean of its divisors is an integer number (568001636460).
Almost surely, 210201002303105 is an apocalyptic number.
10201002303105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10201002303105 is a deficient number, since it is larger than the sum of its proper divisors (7975050063615).
10201002303105 is a wasteful number, since it uses less digits than its factorization.
10201002303105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170571518 (or 170571512 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
Adding to 10201002303105 its reverse (50130320010201), we get a palindrome (60331322313306).
The spelling of 10201002303105 in words is "ten trillion, two hundred one billion, two million, three hundred three thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •