Base | Representation |
---|---|
bin | 1000101001001011… |
… | …0111010111110001 |
3 | 12222200212102200211 |
4 | 2022102313113301 |
5 | 14222432414301 |
6 | 1022121544121 |
7 | 111332245663 |
oct | 21222672761 |
9 | 5880772624 |
10 | 2320201201 |
11 | a9076955a |
12 | 549045041 |
13 | 2ac8c9026 |
14 | 18020a533 |
15 | d8a62051 |
hex | 8a4b75f1 |
2320201201 has 8 divisors (see below), whose sum is σ = 2370251520. Its totient is φ = 2270179488.
The previous prime is 2320201183. The next prime is 2320201211. The reversal of 2320201201 is 1021020232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2320201201 - 211 = 2320199153 is a prime.
It is a super-2 number, since 2×23202012012 = 10766667226243684802, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2320201211) 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 7 ways as a sum of consecutive naturals, for example, 274405 + ... + 282733.
It is an arithmetic number, because the mean of its divisors is an integer number (296281440).
Almost surely, 22320201201 is an apocalyptic number.
It is an amenable number.
2320201201 is a deficient number, since it is larger than the sum of its proper divisors (50050319).
2320201201 is an equidigital number, since it uses as much as digits as its factorization.
2320201201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14303.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 2320201201 is about 48168.4668740868. The cubic root of 2320201201 is about 1323.8594577730.
Adding to 2320201201 its reverse (1021020232), we get a palindrome (3341221433).
The spelling of 2320201201 in words is "two billion, three hundred twenty million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •