Base | Representation |
---|---|
bin | 101011110011011101111… |
… | …010001101001001010100 |
3 | 101122202212000121120111121 |
4 | 223303131322031021110 |
5 | 343304342213131012 |
6 | 10222511123413324 |
7 | 430323364634566 |
oct | 53633572151124 |
9 | 11582760546447 |
10 | 3010200130132 |
11 | a60689552498 |
12 | 407491b24244 |
13 | 18ab25b1b970 |
14 | a59a1873336 |
15 | 5347ee84a07 |
hex | 2bcdde8d254 |
3010200130132 has 12 divisors (see below), whose sum is σ = 5673069476116. Its totient is φ = 1389323136960.
The previous prime is 3010200130109. The next prime is 3010200130141. The reversal of 3010200130132 is 2310310020103.
It can be written as a sum of positive squares in 2 ways, for example, as 474602499396 + 2535597630736 = 688914^2 + 1592356^2 .
It is a super-2 number, since 2×30102001301322 (a number of 26 digits) contains 22 as substring.
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 3 ways as a sum of consecutive naturals, for example, 28944231969 + ... + 28944232072.
Almost surely, 23010200130132 is an apocalyptic number.
It is an amenable number.
3010200130132 is a deficient number, since it is larger than the sum of its proper divisors (2662869345984).
3010200130132 is a wasteful number, since it uses less digits than its factorization.
3010200130132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57888464058 (or 57888464056 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 3010200130132 its reverse (2310310020103), we get a palindrome (5320510150235).
The spelling of 3010200130132 in words is "three trillion, ten billion, two hundred million, one hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •