Base | Representation |
---|---|
bin | 11101100010100101011… |
… | …011100100010101111000 |
3 | 21012001210012012022222220 |
4 | 131202211123210111320 |
5 | 231224420001443341 |
6 | 4152322533444040 |
7 | 266443202363412 |
oct | 35424533442570 |
9 | 7161705168886 |
10 | 2030000031096 |
11 | 712a11106214 |
12 | 289516aa0620 |
13 | 11957493a66b |
14 | 70376d059b2 |
15 | 37c11b10a66 |
hex | 1d8a56e4578 |
2030000031096 has 16 divisors (see below), whose sum is σ = 5075000077800. Its totient is φ = 676666677024.
The previous prime is 2030000031089. The next prime is 2030000031097. The reversal of 2030000031096 is 6901300000302.
It is a super-2 number, since 2×20300000310962 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 84583334629 = 2030000031096 / (2 + 0 + 3 + 0 + 0 + 0 + 0 + 0 + 3 + 1 + 0 + 9 + 6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2030000031097) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42291667291 + ... + 42291667338.
Almost surely, 22030000031096 is an apocalyptic number.
It is an amenable number.
2030000031096 is an abundant number, since it is smaller than the sum of its proper divisors (3045000046704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2030000031096 is a wasteful number, since it uses less digits than its factorization.
2030000031096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84583334638 (or 84583334634 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 2030000031096 its reverse (6901300000302), we get a palindrome (8931300031398).
The spelling of 2030000031096 in words is "two trillion, thirty billion, thirty-one thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •