Base | Representation |
---|---|
bin | 11101001001101011… |
… | …111010111010000001 |
3 | 2222210102101122002200 |
4 | 131021223322322001 |
5 | 1003101030140223 |
6 | 22213545303413 |
7 | 2155445201622 |
oct | 351153727201 |
9 | 88712348080 |
10 | 31301021313 |
11 | 12302679661 |
12 | 6096794b69 |
13 | 2c4aa99bb3 |
14 | 172d153a49 |
15 | c32e6ba43 |
hex | 749afae81 |
31301021313 has 12 divisors (see below), whose sum is σ = 46434548628. Its totient is φ = 20303364960.
The previous prime is 31301021309. The next prime is 31301021321. The reversal of 31301021313 is 31312010313.
It is a happy number.
31301021313 is a `hidden beast` number, since 31 + 301 + 0 + 21 + 313 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 10684943424 + 20616077889 = 103368^2 + 143583^2 .
It is not a de Polignac number, because 31301021313 - 22 = 31301021309 is a prime.
It is not an unprimeable number, because it can be changed into a prime (31301021393) 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 11 ways as a sum of consecutive naturals, for example, 46998198 + ... + 46998863.
It is an arithmetic number, because the mean of its divisors is an integer number (3869545719).
Almost surely, 231301021313 is an apocalyptic number.
It is an amenable number.
31301021313 is a deficient number, since it is larger than the sum of its proper divisors (15133527315).
31301021313 is a wasteful number, since it uses less digits than its factorization.
31301021313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93997104 (or 93997101 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 31301021313 its reverse (31312010313), we get a palindrome (62613031626).
The spelling of 31301021313 in words is "thirty-one billion, three hundred one million, twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •