Base | Representation |
---|---|
bin | 100010111101010100010… |
… | …111010111100011000001 |
3 | 22111122202120021120010122 |
4 | 202331110113113203001 |
5 | 303324403321132434 |
6 | 5035334035510025 |
7 | 335363200122311 |
oct | 42752427274301 |
9 | 8448676246118 |
10 | 2402302130369 |
11 | 8468a0a19869 |
12 | 3296ba158315 |
13 | 1456c7b1241b |
14 | 843b46b7441 |
15 | 42751a68c2e |
hex | 22f545d78c1 |
2402302130369 has 2 divisors, whose sum is σ = 2402302130370. Its totient is φ = 2402302130368.
The previous prime is 2402302130287. The next prime is 2402302130377. The reversal of 2402302130369 is 9630312032042.
2402302130369 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2390657130625 + 11644999744 = 1546175^2 + 107912^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2402302130369 is a prime.
It is a super-2 number, since 2×24023021303692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2402302430369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1201151065184 + 1201151065185.
It is an arithmetic number, because the mean of its divisors is an integer number (1201151065185).
Almost surely, 22402302130369 is an apocalyptic number.
It is an amenable number.
2402302130369 is a deficient number, since it is larger than the sum of its proper divisors (1).
2402302130369 is an equidigital number, since it uses as much as digits as its factorization.
2402302130369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 35.
The spelling of 2402302130369 in words is "two trillion, four hundred two billion, three hundred two million, one hundred thirty thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •