Base | Representation |
---|---|
bin | 11101001010010111101… |
… | …11110110101100101011 |
3 | 10112210100010100212020120 |
4 | 32211023313312230223 |
5 | 112404044040010011 |
6 | 2044151304054323 |
7 | 132251334063516 |
oct | 16451367665453 |
9 | 3483303325216 |
10 | 1002000313131 |
11 | 356a45066844 |
12 | 14223ba643a3 |
13 | 7364682258c |
14 | 366d5d83d7d |
15 | 1b0e718ba06 |
hex | e94bdf6b2b |
1002000313131 has 16 divisors (see below), whose sum is σ = 1345836122400. Its totient is φ = 663097374720.
The previous prime is 1002000313123. The next prime is 1002000313133. The reversal of 1002000313131 is 1313130002001.
It is not a de Polignac number, because 1002000313131 - 23 = 1002000313123 is a prime.
It is a super-2 number, since 2×10020003131312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1002000313131.
It is not an unprimeable number, because it can be changed into a prime (1002000313133) 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, 1610056 + ... + 2143893.
It is an arithmetic number, because the mean of its divisors is an integer number (84114757650).
Almost surely, 21002000313131 is an apocalyptic number.
1002000313131 is a deficient number, since it is larger than the sum of its proper divisors (343835809269).
1002000313131 is a wasteful number, since it uses less digits than its factorization.
1002000313131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3754606.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 1002000313131 its reverse (1313130002001), we get a palindrome (2315130315132).
It can be divided in two parts, 1002000 and 313131, that added together give a palindrome (1315131).
The spelling of 1002000313131 in words is "one trillion, two billion, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •