Base | Representation |
---|---|
bin | 111010101011101… |
… | …0000010101100100 |
3 | 12002020002010001120 |
4 | 1311113100111210 |
5 | 13013032434000 |
6 | 523215053540 |
7 | 66536324463 |
oct | 16527202544 |
9 | 5066063046 |
10 | 1969030500 |
11 | 920514838 |
12 | 46b5112b0 |
13 | 254c23008 |
14 | 1497169da |
15 | b7ce66a0 |
hex | 755d0564 |
1969030500 has 96 divisors (see below), whose sum is σ = 5786901120. Its totient is φ = 520214400.
The previous prime is 1969030471. The next prime is 1969030519. The reversal of 1969030500 is 50309691.
It is a super-2 number, since 2×19690305002 = 7754162219860500000, which contains 22 as substring.
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, 157479 + ... + 169521.
It is an arithmetic number, because the mean of its divisors is an integer number (60280220).
Almost surely, 21969030500 is an apocalyptic number.
1969030500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1969030500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2893450560).
1969030500 is an abundant number, since it is smaller than the sum of its proper divisors (3817870620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1969030500 is a wasteful number, since it uses less digits than its factorization.
1969030500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12174 (or 12162 counting only the distinct ones).
The product of its (nonzero) digits is 7290, while the sum is 33.
The square root of 1969030500 is about 44373.7591375804. The cubic root of 1969030500 is about 1253.3840038805.
The spelling of 1969030500 in words is "one billion, nine hundred sixty-nine million, thirty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •