Base | Representation |
---|---|
bin | 1000110100110000011… |
… | …00100001011001110011 |
3 | 1001222121121102021201011 |
4 | 10122120030201121303 |
5 | 14431423442130344 |
6 | 351142204251351 |
7 | 30622415040220 |
oct | 4323014413163 |
9 | 1058547367634 |
10 | 303201130099 |
11 | 10765015176a |
12 | 4a919540b57 |
13 | 227900a492a |
14 | 10964342947 |
15 | 7d48731d34 |
hex | 4698321673 |
303201130099 has 4 divisors (see below), whose sum is σ = 346515577264. Its totient is φ = 259886682936.
The previous prime is 303201130097. The next prime is 303201130129. The reversal of 303201130099 is 990031102303.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 990031102303 = 4943 ⋅200289521.
It is a cyclic number.
It is not a de Polignac number, because 303201130099 - 21 = 303201130097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 303201130099.
It is not an unprimeable number, because it can be changed into a prime (303201130093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21657223572 + ... + 21657223585.
It is an arithmetic number, because the mean of its divisors is an integer number (86628894316).
Almost surely, 2303201130099 is an apocalyptic number.
303201130099 is a deficient number, since it is larger than the sum of its proper divisors (43314447165).
303201130099 is an equidigital number, since it uses as much as digits as its factorization.
303201130099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43314447164.
The product of its (nonzero) digits is 4374, while the sum is 31.
The spelling of 303201130099 in words is "three hundred three billion, two hundred one million, one hundred thirty thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •