Base | Representation |
---|---|
bin | 1011101000110011011… |
… | …0001000100101000010 |
3 | 201010001120101100201202 |
4 | 2322030312020211002 |
5 | 11233424430344040 |
6 | 231503001501202 |
7 | 20305326453065 |
oct | 2721466104502 |
9 | 633046340652 |
10 | 199931496770 |
11 | 77877132765 |
12 | 328b87a1802 |
13 | 15b13085a15 |
14 | 9968d6c8dc |
15 | 5302442015 |
hex | 2e8cd88942 |
199931496770 has 64 divisors (see below), whose sum is σ = 373168101600. Its totient is φ = 77070336000.
The previous prime is 199931496757. The next prime is 199931496823. The reversal of 199931496770 is 77694139991.
It is a Cunningham number, because it is equal to 4471372+1.
It can be written as a sum of positive squares in 16 ways, for example, as 76219614241 + 123711882529 = 276079^2 + 351727^2 .
It is a junction number, because it is equal to n+sod(n) for n = 199931496697 and 199931496706.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18587714 + ... + 18598466.
Almost surely, 2199931496770 is an apocalyptic number.
199931496770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
199931496770 is a deficient number, since it is larger than the sum of its proper divisors (173236604830).
199931496770 is a wasteful number, since it uses less digits than its factorization.
199931496770 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11351.
The product of its (nonzero) digits is 23147208, while the sum is 65.
The spelling of 199931496770 in words is "one hundred ninety-nine billion, nine hundred thirty-one million, four hundred ninety-six thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •