Base | Representation |
---|---|
bin | 1000101011100100… |
… | …0011010001001001 |
3 | 20000101201000002222 |
4 | 2022321003101021 |
5 | 14233013231101 |
6 | 1023120303425 |
7 | 111513320150 |
oct | 21271032111 |
9 | 6011630088 |
10 | 2330211401 |
11 | a96386351 |
12 | 550471b75 |
13 | 2b19c241b |
14 | 181694597 |
15 | d988d01b |
hex | 8ae43449 |
2330211401 has 8 divisors (see below), whose sum is σ = 2669743104. Its totient is φ = 1992340800.
The previous prime is 2330211383. The next prime is 2330211599. The reversal of 2330211401 is 1041120332.
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 2330211401 - 218 = 2329949257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2330211401.
It is not an unprimeable number, because it can be changed into a prime (2330211901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 412265 + ... + 417878.
It is an arithmetic number, because the mean of its divisors is an integer number (333717888).
Almost surely, 22330211401 is an apocalyptic number.
It is an amenable number.
2330211401 is a deficient number, since it is larger than the sum of its proper divisors (339531703).
2330211401 is an equidigital number, since it uses as much as digits as its factorization.
2330211401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830551.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2330211401 is about 48272.2632678436. The cubic root of 2330211401 is about 1325.7605982644.
Adding to 2330211401 its reverse (1041120332), we get a palindrome (3371331733).
The spelling of 2330211401 in words is "two billion, three hundred thirty million, two hundred eleven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •