Base | Representation |
---|---|
bin | 100001011110000100011… |
… | …111010011110001000111 |
3 | 22010212210001210110000202 |
4 | 201132010133103301013 |
5 | 300140430224201203 |
6 | 4520341435401115 |
7 | 325112616001265 |
oct | 41360437236107 |
9 | 8125701713022 |
10 | 2300030303303 |
11 | 80748a165437 |
12 | 3119175b319b |
13 | 138b79743015 |
14 | 7d471a3d435 |
15 | 3ec68175388 |
hex | 217847d3c47 |
2300030303303 has 16 divisors (see below), whose sum is σ = 2429601647616. Its totient is φ = 2173926928320.
The previous prime is 2300030303257. The next prime is 2300030303339. The reversal of 2300030303303 is 3033030300032.
2300030303303 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 2300030303303 - 210 = 2300030302279 is a prime.
It is a super-2 number, since 2×23000303033032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2300030303393) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23522651 + ... + 23620227.
It is an arithmetic number, because the mean of its divisors is an integer number (151850102976).
Almost surely, 22300030303303 is an apocalyptic number.
2300030303303 is a deficient number, since it is larger than the sum of its proper divisors (129571344313).
2300030303303 is a wasteful number, since it uses less digits than its factorization.
2300030303303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115334.
The product of its (nonzero) digits is 1458, while the sum is 20.
Adding to 2300030303303 its reverse (3033030300032), we get a palindrome (5333060603335).
The spelling of 2300030303303 in words is "two trillion, three hundred billion, thirty million, three hundred three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •