Base | Representation |
---|---|
bin | 1011100111111101011… |
… | …1110111111100000001 |
3 | 201002110211001112020100 |
4 | 2321333113313330001 |
5 | 11232444044213411 |
6 | 231424325033013 |
7 | 20266613256132 |
oct | 2717727677401 |
9 | 632424045210 |
10 | 199705460481 |
11 | 7777058730a |
12 | 32854b55769 |
13 | 15aa82b3937 |
14 | 9946d2dc89 |
15 | 52dc693456 |
hex | 2e7f5f7f01 |
199705460481 has 12 divisors (see below), whose sum is σ = 298410458580. Its totient is φ = 128546043360.
The previous prime is 199705460477. The next prime is 199705460491. The reversal of 199705460481 is 184064507991.
199705460481 is a `hidden beast` number, since 1 + 9 + 97 + 0 + 546 + 0 + 4 + 8 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 39418131600 + 160287328881 = 198540^2 + 400359^2 .
It is not a de Polignac number, because 199705460481 - 22 = 199705460477 is a prime.
It is a super-2 number, since 2×1997054604812 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (199705460441) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 382577250 + ... + 382577771.
It is an arithmetic number, because the mean of its divisors is an integer number (24867538215).
Almost surely, 2199705460481 is an apocalyptic number.
It is an amenable number.
199705460481 is a deficient number, since it is larger than the sum of its proper divisors (98704998099).
199705460481 is a wasteful number, since it uses less digits than its factorization.
199705460481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765155056 (or 765155053 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 54.
The spelling of 199705460481 in words is "one hundred ninety-nine billion, seven hundred five million, four hundred sixty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •