Base | Representation |
---|---|
bin | 10011100001101100… |
… | …01110111111011000 |
3 | 1000001120222201212012 |
4 | 21300312032333120 |
5 | 132432144344320 |
6 | 4452123205052 |
7 | 520532505122 |
oct | 116066167730 |
9 | 30046881765 |
10 | 10483199960 |
11 | 449a547322 |
12 | 2046976788 |
13 | cb0b3c7cc |
14 | 7163c4212 |
15 | 4155084c5 |
hex | 270d8efd8 |
10483199960 has 16 divisors (see below), whose sum is σ = 23587200000. Its totient is φ = 4193279968.
The previous prime is 10483199941. The next prime is 10483199989. The reversal of 10483199960 is 6999138401.
It is a junction number, because it is equal to n+sod(n) for n = 10483199899 and 10483199908.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 131039960 + ... + 131040039.
It is an arithmetic number, because the mean of its divisors is an integer number (1474200000).
Almost surely, 210483199960 is an apocalyptic number.
10483199960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10483199960 is an abundant number, since it is smaller than the sum of its proper divisors (13104000040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10483199960 is a wasteful number, since it uses less digits than its factorization.
10483199960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262080010 (or 262080006 counting only the distinct ones).
The product of its (nonzero) digits is 419904, while the sum is 50.
The spelling of 10483199960 in words is "ten billion, four hundred eighty-three million, one hundred ninety-nine thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •