Base | Representation |
---|---|
bin | 10010010101101000… |
… | …101001100101000011 |
3 | 1212211020211102110121 |
4 | 102111220221211003 |
5 | 310311211033220 |
6 | 13013504041111 |
7 | 1264642022116 |
oct | 222550514503 |
9 | 55736742417 |
10 | 19690330435 |
11 | 8394750766 |
12 | 3996303197 |
13 | 1b1a4a27c9 |
14 | d4b11657d |
15 | 7a399beaa |
hex | 495a29943 |
19690330435 has 8 divisors (see below), whose sum is σ = 23630029920. Its totient is φ = 15751175424.
The previous prime is 19690330417. The next prime is 19690330487. The reversal of 19690330435 is 53403309691.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 19690330435 - 213 = 19690322243 is a prime.
It is a super-2 number, since 2×196903304352 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 19690330391 and 19690330400.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51807 + ... + 205096.
It is an arithmetic number, because the mean of its divisors is an integer number (2953753740).
Almost surely, 219690330435 is an apocalyptic number.
19690330435 is a deficient number, since it is larger than the sum of its proper divisors (3939699485).
19690330435 is a wasteful number, since it uses less digits than its factorization.
19690330435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272237.
The product of its (nonzero) digits is 262440, while the sum is 43.
The spelling of 19690330435 in words is "nineteen billion, six hundred ninety million, three hundred thirty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •