Base | Representation |
---|---|
bin | 1011110101111100001000… |
… | …0110010001111010010110 |
3 | 1201002211020221112111201001 |
4 | 2331133002012101322112 |
5 | 3201320111342102220 |
6 | 43405523110453514 |
7 | 2512521003226243 |
oct | 275370206217226 |
9 | 51084227474631 |
10 | 13021302300310 |
11 | 4170337758267 |
12 | 156374796429a |
13 | 735b990c5045 |
14 | 33033d26a5ca |
15 | 178aa98e980a |
hex | bd7c2191e96 |
13021302300310 has 16 divisors (see below), whose sum is σ = 23438387350800. Its totient is φ = 5208511317856.
The previous prime is 13021302300301. The next prime is 13021302300313. The reversal of 13021302300310 is 1300320312031.
It is a super-2 number, since 2×130213023003102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13021302300313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7494336 + ... + 9066844.
It is an arithmetic number, because the mean of its divisors is an integer number (1464899209425).
Almost surely, 213021302300310 is an apocalyptic number.
13021302300310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13021302300310 is a deficient number, since it is larger than the sum of its proper divisors (10417085050490).
13021302300310 is a wasteful number, since it uses less digits than its factorization.
13021302300310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2400575.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13021302300310 its reverse (1300320312031), we get a palindrome (14321622612341).
The spelling of 13021302300310 in words is "thirteen trillion, twenty-one billion, three hundred two million, three hundred thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •