Base | Representation |
---|---|
bin | 101101001000000010110… |
… | …001111001001011110111 |
3 | 101222110020221002102212002 |
4 | 231020002301321023313 |
5 | 401301333313141211 |
6 | 10332330303045515 |
7 | 440016664525613 |
oct | 55100261711367 |
9 | 11873227072762 |
10 | 3101013021431 |
11 | a96150009876 |
12 | 420bb6ba089b |
13 | 1965691886c0 |
14 | aa1386d4343 |
15 | 559e788303b |
hex | 2d202c792f7 |
3101013021431 has 16 divisors (see below), whose sum is σ = 3348610099968. Its totient is φ = 2854712678400.
The previous prime is 3101013021427. The next prime is 3101013021437. The reversal of 3101013021431 is 1341203101013.
3101013021431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3101013021431 - 22 = 3101013021427 is a prime.
It is a super-2 number, since 2×31010130214312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3101013021437) 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, 28025786 + ... + 28136216.
It is an arithmetic number, because the mean of its divisors is an integer number (209288131248).
Almost surely, 23101013021431 is an apocalyptic number.
3101013021431 is a deficient number, since it is larger than the sum of its proper divisors (247597078537).
3101013021431 is a wasteful number, since it uses less digits than its factorization.
3101013021431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116282.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3101013021431 its reverse (1341203101013), we get a palindrome (4442216122444).
The spelling of 3101013021431 in words is "three trillion, one hundred one billion, thirteen million, twenty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •