Base | Representation |
---|---|
bin | 1001010111100110010011… |
… | …0100101001110001100001 |
3 | 1100110202202000022010221010 |
4 | 2111321210310221301201 |
5 | 2322232443403200001 |
6 | 33524120310451133 |
7 | 2112136645440534 |
oct | 225714464516141 |
9 | 40422660263833 |
10 | 10301023100001 |
11 | 3311703aa1507 |
12 | 11a44a7963aa9 |
13 | 5994c7c2173a |
14 | 2788020b2a1b |
15 | 12ce473478d6 |
hex | 95e64d29c61 |
10301023100001 has 16 divisors (see below), whose sum is σ = 13881434616000. Its totient is φ = 6794032631808.
The previous prime is 10301023099979. The next prime is 10301023100003. The reversal of 10301023100001 is 10000132010301.
It is not a de Polignac number, because 10301023100001 - 239 = 9751267286113 is a prime.
It is a super-3 number, since 3×103010231000013 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 10301023100001.
It is not an unprimeable number, because it can be changed into a prime (10301023100003) 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, 5772336 + ... + 7343153.
It is an arithmetic number, because the mean of its divisors is an integer number (867589663500).
Almost surely, 210301023100001 is an apocalyptic number.
It is an amenable number.
10301023100001 is a deficient number, since it is larger than the sum of its proper divisors (3580411515999).
10301023100001 is a wasteful number, since it uses less digits than its factorization.
10301023100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13118288.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10301023100001 its reverse (10000132010301), we get a palindrome (20301155110302).
The spelling of 10301023100001 in words is "ten trillion, three hundred one billion, twenty-three million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •