Base | Representation |
---|---|
bin | 11101000111010000101… |
… | …00001100010100100011 |
3 | 10112122000201102011222212 |
4 | 32203220110030110203 |
5 | 112342133441121011 |
6 | 2043313435552335 |
7 | 132162052606601 |
oct | 16435024142443 |
9 | 3478021364885 |
10 | 1000330020131 |
11 | 356268243a02 |
12 | 141a545bb6ab |
13 | 7343b777820 |
14 | 365b81d2871 |
15 | 1b04a70508b |
hex | e8e850c523 |
1000330020131 has 8 divisors (see below), whose sum is σ = 1077387426864. Its totient is φ = 923288176800.
The previous prime is 1000330020047. The next prime is 1000330020149. The reversal of 1000330020131 is 1310200330001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1000330020131 is a prime.
It is a super-2 number, since 2×10003300201312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000330020161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3757181 + ... + 4014606.
It is an arithmetic number, because the mean of its divisors is an integer number (134673428358).
Almost surely, 21000330020131 is an apocalyptic number.
1000330020131 is a deficient number, since it is larger than the sum of its proper divisors (77057406733).
1000330020131 is an equidigital number, since it uses as much as digits as its factorization.
1000330020131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7781701.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 1000330020131 its reverse (1310200330001), we get a palindrome (2310530350132).
The spelling of 1000330020131 in words is "one trillion, three hundred thirty million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •