Base | Representation |
---|---|
bin | 100101010000001001001… |
… | …1000001001100100001000 |
3 | 200010110101021200121010210 |
4 | 1022200102120021210020 |
5 | 1132341033242243402 |
6 | 14520015345441120 |
7 | 1035621061212015 |
oct | 112402230114410 |
9 | 20113337617123 |
10 | 5119909337352 |
11 | 16a4383388477 |
12 | 6a83333401a0 |
13 | 2b1a61556ba4 |
14 | 139b3aa4c70c |
15 | 8d2a976906c |
hex | 4a812609908 |
5119909337352 has 32 divisors (see below), whose sum is σ = 12800173510080. Its totient is φ = 1706583090240.
The previous prime is 5119909337341. The next prime is 5119909337399. The reversal of 5119909337352 is 2537339099115.
It is a junction number, because it is equal to n+sod(n) for n = 5119909337292 and 5119909337301.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2547268 + ... + 4090035.
It is an arithmetic number, because the mean of its divisors is an integer number (400005422190).
Almost surely, 25119909337352 is an apocalyptic number.
It is an amenable number.
5119909337352 is an abundant number, since it is smaller than the sum of its proper divisors (7680264172728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5119909337352 is a wasteful number, since it uses less digits than its factorization.
5119909337352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6669453 (or 6669449 counting only the distinct ones).
The product of its (nonzero) digits is 6889050, while the sum is 57.
The spelling of 5119909337352 in words is "five trillion, one hundred nineteen billion, nine hundred nine million, three hundred thirty-seven thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •