Base | Representation |
---|---|
bin | 1011101001000001001… |
… | …0110001110111100100 |
3 | 201010012121012222101200 |
4 | 2322100102301313210 |
5 | 11234034232300242 |
6 | 231512425322500 |
7 | 20306631215133 |
oct | 2722022616744 |
9 | 633177188350 |
10 | 199989337572 |
11 | 778a6849382 |
12 | 32914036430 |
13 | 15b22057c4b |
14 | 997290791a |
15 | 530756a04c |
hex | 2e904b1de4 |
199989337572 has 36 divisors (see below), whose sum is σ = 505826302800. Its totient is φ = 66623855472.
The previous prime is 199989337567. The next prime is 199989337589. The reversal of 199989337572 is 275733989991.
199989337572 is a `hidden beast` number, since 19 + 9 + 9 + 8 + 9 + 3 + 37 + 572 = 666.
199989337572 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (36).
It is a self number, because there is not a number n which added to its sum of digits gives 199989337572.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1573698 + ... + 1696025.
Almost surely, 2199989337572 is an apocalyptic number.
199989337572 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
199989337572 is an abundant number, since it is smaller than the sum of its proper divisors (305836965228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
199989337572 is a wasteful number, since it uses less digits than its factorization.
199989337572 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3271432 (or 3271427 counting only the distinct ones).
The product of its digits is 231472080, while the sum is 72.
The spelling of 199989337572 in words is "one hundred ninety-nine billion, nine hundred eighty-nine million, three hundred thirty-seven thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •