Base | Representation |
---|---|
bin | 10111001100010011110101… |
… | …111111000101100101111110 |
3 | 111101011012102210020000002211 |
4 | 113030103311333011211332 |
5 | 101332141032114120220 |
6 | 1000534341154011034 |
7 | 30325221060104221 |
oct | 2714236577054576 |
9 | 441135383200084 |
10 | 102001010301310 |
11 | 2a55642717731a |
12 | b53458bb76a7a |
13 | 44bb866ab3233 |
14 | 1b28c379315b8 |
15 | bbd431315b5a |
hex | 5cc4f5fc597e |
102001010301310 has 64 divisors (see below), whose sum is σ = 195552327720960. Its totient is φ = 38245777320960.
The previous prime is 102001010301287. The next prime is 102001010301319. The reversal of 102001010301310 is 13103010100201.
It is a super-2 number, since 2×1020010103013102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102001010301319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34673080 + ... + 37499659.
It is an arithmetic number, because the mean of its divisors is an integer number (3055505120640).
Almost surely, 2102001010301310 is an apocalyptic number.
102001010301310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102001010301310 is a deficient number, since it is larger than the sum of its proper divisors (93551317419650).
102001010301310 is a wasteful number, since it uses less digits than its factorization.
102001010301310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72172921.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 102001010301310 its reverse (13103010100201), we get a palindrome (115104020401511).
The spelling of 102001010301310 in words is "one hundred two trillion, one billion, ten million, three hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •