Base | Representation |
---|---|
bin | 1011000011111010100… |
… | …1100101100001100011 |
3 | 200011111111022102112220 |
4 | 2300332221211201203 |
5 | 11103140042300034 |
6 | 223144242522123 |
7 | 16505053242156 |
oct | 2607651454143 |
9 | 604444272486 |
10 | 190029650019 |
11 | 73655868740 |
12 | 309b4666343 |
13 | 14bc58135c1 |
14 | 92a9c79c9d |
15 | 4e22ec1749 |
hex | 2c3ea65863 |
190029650019 has 32 divisors (see below), whose sum is σ = 300575909376. Its totient is φ = 105465208320.
The previous prime is 190029650017. The next prime is 190029650101. The reversal of 190029650019 is 910056920091.
It is a happy number.
190029650019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 190029650019 - 21 = 190029650017 is a prime.
It is a super-2 number, since 2×1900296500192 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (190029650017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4556727 + ... + 4598240.
It is an arithmetic number, because the mean of its divisors is an integer number (9392997168).
Almost surely, 2190029650019 is an apocalyptic number.
190029650019 is a deficient number, since it is larger than the sum of its proper divisors (110546259357).
190029650019 is a wasteful number, since it uses less digits than its factorization.
190029650019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9155035.
The product of its (nonzero) digits is 43740, while the sum is 42.
It can be divided in two parts, 190029 and 650019, that added together give a palindrome (840048).
The spelling of 190029650019 in words is "one hundred ninety billion, twenty-nine million, six hundred fifty thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •