Base | Representation |
---|---|
bin | 1001010111101011000110… |
… | …1110000010110001001001 |
3 | 1100110220001220212200021002 |
4 | 2111322301232002301021 |
5 | 2322243114140304001 |
6 | 33524452314224345 |
7 | 2112213632302115 |
oct | 225726156026111 |
9 | 40426056780232 |
10 | 10302313213001 |
11 | 33122062564a7 |
12 | 11a47a7a250b5 |
13 | 5996722a7404 |
14 | 2788c557c745 |
15 | 12cec073346b |
hex | 95eb1b82c49 |
10302313213001 has 8 divisors (see below), whose sum is σ = 10529701948800. Its totient is φ = 10076811521040.
The previous prime is 10302313212991. The next prime is 10302313213091. The reversal of 10302313213001 is 10031231320301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10302313213001 is a prime.
It is a super-2 number, since 2×103023132130012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10302313213091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 471749921 + ... + 471771758.
It is an arithmetic number, because the mean of its divisors is an integer number (1316212743600).
Almost surely, 210302313213001 is an apocalyptic number.
It is an amenable number.
10302313213001 is a deficient number, since it is larger than the sum of its proper divisors (227388735799).
10302313213001 is an equidigital number, since it uses as much as digits as its factorization.
10302313213001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 943521919.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10302313213001 its reverse (10031231320301), we get a palindrome (20333544533302).
The spelling of 10302313213001 in words is "ten trillion, three hundred two billion, three hundred thirteen million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •