Base | Representation |
---|---|
bin | 11101000110111101011… |
… | …000001110000001101000 |
3 | 21002020012221001000120111 |
4 | 131012331120032001220 |
5 | 230233142240112433 |
6 | 4130535300504104 |
7 | 264343134154330 |
oct | 35067530160150 |
9 | 7066187030514 |
10 | 2000337035368 |
11 | 70137a120511 |
12 | 2838189ab034 |
13 | 11682832b499 |
14 | 6cb615440c0 |
15 | 370778a4dcd |
hex | 1d1bd60e068 |
2000337035368 has 16 divisors (see below), whose sum is σ = 4286436504480. Its totient is φ = 857287300848.
The previous prime is 2000337035363. The next prime is 2000337035387. The reversal of 2000337035368 is 8635307330002.
It is a self number, because there is not a number n which added to its sum of digits gives 2000337035368.
It is not an unprimeable number, because it can be changed into a prime (2000337035363) 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 3 ways as a sum of consecutive naturals, for example, 17860152046 + ... + 17860152157.
It is an arithmetic number, because the mean of its divisors is an integer number (267902281530).
Almost surely, 22000337035368 is an apocalyptic number.
2000337035368 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
2000337035368 is an abundant number, since it is smaller than the sum of its proper divisors (2286099469112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000337035368 is a wasteful number, since it uses less digits than its factorization.
2000337035368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35720304216 (or 35720304212 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 40.
The spelling of 2000337035368 in words is "two trillion, three hundred thirty-seven million, thirty-five thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •