Base | Representation |
---|---|
bin | 111010101101000… |
… | …1011100010001010 |
3 | 12002021112001212000 |
4 | 1311122023202022 |
5 | 13013232003013 |
6 | 523243331430 |
7 | 66546000102 |
oct | 16532134212 |
9 | 5067461760 |
10 | 1969797258 |
11 | 920998920 |
12 | 46b820b76 |
13 | 255131010 |
14 | 149876202 |
15 | b7de8973 |
hex | 7568b88a |
1969797258 has 128 divisors (see below), whose sum is σ = 5240712960. Its totient is φ = 540483840.
The previous prime is 1969797223. The next prime is 1969797281. The reversal of 1969797258 is 8527979691.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1969797195 and 1969797204.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 406860 + ... + 411672.
It is an arithmetic number, because the mean of its divisors is an integer number (40943070).
Almost surely, 21969797258 is an apocalyptic number.
1969797258 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1969797258, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2620356480).
1969797258 is an abundant number, since it is smaller than the sum of its proper divisors (3270915702).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1969797258 is a wasteful number, since it uses less digits than its factorization.
1969797258 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4901 (or 4895 counting only the distinct ones).
The product of its digits is 17146080, while the sum is 63.
The square root of 1969797258 is about 44382.3980649987. The cubic root of 1969797258 is about 1253.5466757288.
The spelling of 1969797258 in words is "one billion, nine hundred sixty-nine million, seven hundred ninety-seven thousand, two hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •