Base | Representation |
---|---|
bin | 11101101001110000100111… |
… | …101100110110010101000000 |
3 | 122002202100212220011222221220 |
4 | 131221300213230312111000 |
5 | 114043141413034402112 |
6 | 1141210532434115040 |
7 | 36320014012513443 |
oct | 3551604754662500 |
9 | 562670786158856 |
10 | 130413053044032 |
11 | 3860a957644820 |
12 | 12762b0b71ba80 |
13 | 579cb8a278005 |
14 | 242c04db7765a |
15 | 1012521dc098c |
hex | 769c27b36540 |
130413053044032 has 112 divisors (see below), whose sum is σ = 377428663837632. Its totient is φ = 39413157396480.
The previous prime is 130413053044003. The next prime is 130413053044069. The reversal of 130413053044032 is 230440350314031.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 130413053043984 and 130413053044002.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81985153 + ... + 83560704.
Almost surely, 2130413053044032 is an apocalyptic number.
130413053044032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130413053044032 is an abundant number, since it is smaller than the sum of its proper divisors (247015610793600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130413053044032 is a wasteful number, since it uses less digits than its factorization.
130413053044032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165546256 (or 165546246 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 33.
The spelling of 130413053044032 in words is "one hundred thirty trillion, four hundred thirteen billion, fifty-three million, forty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •