Base | Representation |
---|---|
bin | 11101101001010100010101… |
… | …101000001100110001110110 |
3 | 122002122110111111110210022012 |
4 | 131221110111220030301312 |
5 | 114042142214334024220 |
6 | 1141144551215004222 |
7 | 36314560324114430 |
oct | 3551242550146166 |
9 | 562573444423265 |
10 | 130382685064310 |
11 | 385a8a93716118 |
12 | 12759055509672 |
13 | 579a05a8a3043 |
14 | 242a7ac901650 |
15 | 1011845d0aac5 |
hex | 769515a0cc76 |
130382685064310 has 32 divisors (see below), whose sum is σ = 277464630288960. Its totient is φ = 43161164710272.
The previous prime is 130382685064267. The next prime is 130382685064349. The reversal of 130382685064310 is 13460586283031.
It is a super-2 number, since 2×1303826850643102 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
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, 32113959809 + ... + 32113963868.
It is an arithmetic number, because the mean of its divisors is an integer number (8670769696530).
Almost surely, 2130382685064310 is an apocalyptic number.
130382685064310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
130382685064310 is an abundant number, since it is smaller than the sum of its proper divisors (147081945224650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130382685064310 is a wasteful number, since it uses less digits than its factorization.
130382685064310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64227923720.
The product of its (nonzero) digits is 2488320, while the sum is 50.
The spelling of 130382685064310 in words is "one hundred thirty trillion, three hundred eighty-two billion, six hundred eighty-five million, sixty-four thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •