Base | Representation |
---|---|
bin | 1000110100100111111… |
… | …01001011101100000011 |
3 | 1001222102122120111201220 |
4 | 10122103331023230003 |
5 | 14431302240001011 |
6 | 351131143530123 |
7 | 30620562326220 |
oct | 4322375135403 |
9 | 1058378514656 |
10 | 303130000131 |
11 | 107613a89772 |
12 | 4a8b9759943 |
13 | 2277b42b9aa |
14 | 10958b08947 |
15 | 7d42381506 |
hex | 4693f4bb03 |
303130000131 has 32 divisors (see below), whose sum is σ = 476931686400. Its totient is φ = 167587691040.
The previous prime is 303130000099. The next prime is 303130000153. The reversal of 303130000131 is 131000031303.
It is not a de Polignac number, because 303130000131 - 25 = 303130000099 is a prime.
It is a super-2 number, since 2×3031300001312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 303130000131.
It is not an unprimeable number, because it can be changed into a prime (303130000171) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2651530 + ... + 2763488.
It is an arithmetic number, because the mean of its divisors is an integer number (14904115200).
Almost surely, 2303130000131 is an apocalyptic number.
303130000131 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
303130000131 is a deficient number, since it is larger than the sum of its proper divisors (173801686269).
303130000131 is a wasteful number, since it uses less digits than its factorization.
303130000131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116159.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 303130000131 its reverse (131000031303), we get a palindrome (434130031434).
The spelling of 303130000131 in words is "three hundred three billion, one hundred thirty million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •