Base | Representation |
---|---|
bin | 11101101001101111110111… |
… | …100000000111111101011011 |
3 | 122002202021210112120201122102 |
4 | 131221233313200013331123 |
5 | 114043133234031331021 |
6 | 1141210320310114015 |
7 | 36316654663254515 |
oct | 3551576740077533 |
9 | 562667715521572 |
10 | 130412244402011 |
11 | 3860a582141030 |
12 | 1276292494b90b |
13 | 579ca8b88a700 |
14 | 242bdb45dcbb5 |
15 | 10124c5ddd00b |
hex | 769bf7807f5b |
130412244402011 has 12 divisors (see below), whose sum is σ = 154053409742280. Its totient is φ = 109436848447680.
The previous prime is 130412244401983. The next prime is 130412244402023. The reversal of 130412244402011 is 110204442214031.
It is a de Polignac number, because none of the positive numbers 2k-130412244402011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130412244402061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 35075911106 + ... + 35075914823.
It is an arithmetic number, because the mean of its divisors is an integer number (12837784145190).
Almost surely, 2130412244402011 is an apocalyptic number.
130412244402011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130412244402011 is a deficient number, since it is larger than the sum of its proper divisors (23641165340269).
130412244402011 is a wasteful number, since it uses less digits than its factorization.
130412244402011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70151825966 (or 70151825953 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 130412244402011 its reverse (110204442214031), we get a palindrome (240616686616042).
The spelling of 130412244402011 in words is "one hundred thirty trillion, four hundred twelve billion, two hundred forty-four million, four hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •