Base | Representation |
---|---|
bin | 10010111011000111010… |
… | …101000110100001101010 |
3 | 11121022121210210012101120 |
4 | 102323013111012201222 |
5 | 132301232111234010 |
6 | 2433223502200110 |
7 | 162644504230254 |
oct | 22730725064152 |
9 | 4538553705346 |
10 | 1300424321130 |
11 | 461563699a10 |
12 | 190045583036 |
13 | 95824ca2c2c |
14 | 46d25a80cd4 |
15 | 23c612dee70 |
hex | 12ec754686a |
1300424321130 has 64 divisors (see below), whose sum is σ = 3522152419200. Its totient is φ = 304383537920.
The previous prime is 1300424321113. The next prime is 1300424321167. The reversal of 1300424321130 is 311234240031.
It is a happy number.
It is a super-2 number, since 2×13004243211302 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1300424321130.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67933185 + ... + 67952324.
It is an arithmetic number, because the mean of its divisors is an integer number (55033631550).
Almost surely, 21300424321130 is an apocalyptic number.
1300424321130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1300424321130 is an abundant number, since it is smaller than the sum of its proper divisors (2221728098070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300424321130 is a wasteful number, since it uses less digits than its factorization.
1300424321130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135885559.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1300424321130 its reverse (311234240031), we get a palindrome (1611658561161).
The spelling of 1300424321130 in words is "one trillion, three hundred billion, four hundred twenty-four million, three hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •