Base | Representation |
---|---|
bin | 101110110110001110101010… |
… | …110101001001111001011100 |
3 | 1000000111220211211010122020220 |
4 | 232312032222311021321130 |
5 | 204001201222001423213 |
6 | 2010111550033441340 |
7 | 61253443354446042 |
oct | 5666165265117134 |
9 | 1000456754118226 |
10 | 206036742217308 |
11 | 5a716767684452 |
12 | 1b137374110250 |
13 | 8ac7248780a62 |
14 | 38c4335474392 |
15 | 18c474d9e9e23 |
hex | bb63aad49e5c |
206036742217308 has 48 divisors (see below), whose sum is σ = 509436266492160. Its totient is φ = 64587636346624.
The previous prime is 206036742217307. The next prime is 206036742217331. The reversal of 206036742217308 is 803712247630602.
It is a super-2 number, since 2×2060367422173082 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206036742217307) 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, 400848816 + ... + 401362487.
It is an arithmetic number, because the mean of its divisors is an integer number (10613255551920).
Almost surely, 2206036742217308 is an apocalyptic number.
It is an amenable number.
206036742217308 is an abundant number, since it is smaller than the sum of its proper divisors (303399524274852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206036742217308 is a wasteful number, since it uses less digits than its factorization.
206036742217308 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 802212586 (or 802212584 counting only the distinct ones).
The product of its (nonzero) digits is 4064256, while the sum is 51.
The spelling of 206036742217308 in words is "two hundred six trillion, thirty-six billion, seven hundred forty-two million, two hundred seventeen thousand, three hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •