Base | Representation |
---|---|
bin | 111100101010010100… |
… | …1000101110101110000 |
3 | 110110020200020202200000 |
4 | 1321110221011311300 |
5 | 4113242340424343 |
6 | 135502250230000 |
7 | 12261121611651 |
oct | 1712451056560 |
9 | 413220222600 |
10 | 130269076848 |
11 | 50279552599 |
12 | 212b6a25300 |
13 | c3908663c1 |
14 | 643b10d528 |
15 | 35c67b4ed3 |
hex | 1e54a45d70 |
130269076848 has 120 divisors (see below), whose sum is σ = 378224469168. Its totient is φ = 43405880832.
The previous prime is 130269076831. The next prime is 130269076853. The reversal of 130269076848 is 848670962031.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 130269076794 and 130269076803.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13264836 + ... + 13274652.
Almost surely, 2130269076848 is an apocalyptic number.
130269076848 is a gapful number since it is divisible by the number (18) 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 130269076848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189112234584).
130269076848 is an abundant number, since it is smaller than the sum of its proper divisors (247955392320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130269076848 is an equidigital number, since it uses as much as digits as its factorization.
130269076848 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13253 (or 13235 counting only the distinct ones).
The product of its (nonzero) digits is 3483648, while the sum is 54.
The spelling of 130269076848 in words is "one hundred thirty billion, two hundred sixty-nine million, seventy-six thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •