Base | Representation |
---|---|
bin | 111100101000100011110011… |
… | …100001110001001111110010 |
3 | 1021222012101220212100100120100 |
4 | 330220203303201301033302 |
5 | 234423110142342040002 |
6 | 2343054302545453230 |
7 | 110112162400156014 |
oct | 7450436341611762 |
9 | 1258171825310510 |
10 | 266670015190002 |
11 | 77a73133557996 |
12 | 25aaa528641216 |
13 | b5a4b4a45cc68 |
14 | 49bcc7d03c1b4 |
15 | 20c6a7455911c |
hex | f288f38713f2 |
266670015190002 has 12 divisors (see below), whose sum is σ = 577785032911710. Its totient is φ = 88890005063328.
The previous prime is 266670015190001. The next prime is 266670015190081. The reversal of 266670015190002 is 200091510076662.
It can be written as a sum of positive squares in only one way, i.e., 167979718568601 + 98690296621401 = 12960699^2 + 9934299^2 .
It is a super-2 number, since 2×2666700151900022 (a number of 30 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 266670015190002.
It is not an unprimeable number, because it can be changed into a prime (266670015190001) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7407500421927 + ... + 7407500421962.
Almost surely, 2266670015190002 is an apocalyptic number.
266670015190002 is an abundant number, since it is smaller than the sum of its proper divisors (311115017721708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
266670015190002 is a wasteful number, since it uses less digits than its factorization.
266670015190002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14815000843897 (or 14815000843894 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The spelling of 266670015190002 in words is "two hundred sixty-six trillion, six hundred seventy billion, fifteen million, one hundred ninety thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •