Base | Representation |
---|---|
bin | 1001010001110010111000… |
… | …0100110001100000100111 |
3 | 1100010020101112221201101011 |
4 | 2110130232010301200213 |
5 | 2314114301001100203 |
6 | 33410231042243051 |
7 | 2102010141050563 |
oct | 224345604614047 |
9 | 40106345851334 |
10 | 10201320331303 |
11 | 32833a0419712 |
12 | 1189101656487 |
13 | 58cc98b8080a |
14 | 273a647046a3 |
15 | 12a55e27176d |
hex | 9472e131827 |
10201320331303 has 8 divisors (see below), whose sum is σ = 10226663296400. Its totient is φ = 10176005956608.
The previous prime is 10201320331291. The next prime is 10201320331309. The reversal of 10201320331303 is 30313302310201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10201320331303 - 225 = 10201286776871 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 (10201320331309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6433008 + ... + 7860421.
It is an arithmetic number, because the mean of its divisors is an integer number (1278332912050).
Almost surely, 210201320331303 is an apocalyptic number.
10201320331303 is a deficient number, since it is larger than the sum of its proper divisors (25342965097).
10201320331303 is a wasteful number, since it uses less digits than its factorization.
10201320331303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14295201.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 10201320331303 its reverse (30313302310201), we get a palindrome (40514622641504).
The spelling of 10201320331303 in words is "ten trillion, two hundred one billion, three hundred twenty million, three hundred thirty-one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •