Base | Representation |
---|---|
bin | 100001011111001100010… |
… | …000010111000111010001 |
3 | 22010222212222102001220111 |
4 | 201133030100113013101 |
5 | 300200411443010101 |
6 | 4521101130241321 |
7 | 325154506120216 |
oct | 41371420270721 |
9 | 8128788361814 |
10 | 2301234344401 |
11 | 807a47881323 |
12 | 311bb2886241 |
13 | 13900c020985 |
14 | 7d547901b0d |
15 | 3ecd8c0d251 |
hex | 217cc4171d1 |
2301234344401 has 16 divisors (see below), whose sum is σ = 2342525947200. Its totient is φ = 2260020331008.
The previous prime is 2301234344369. The next prime is 2301234344413. The reversal of 2301234344401 is 1044434321032.
It is a cyclic number.
It is not a de Polignac number, because 2301234344401 - 25 = 2301234344369 is a prime.
It is a super-3 number, since 3×23012343444013 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2301234344701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 344854201 + ... + 344860873.
It is an arithmetic number, because the mean of its divisors is an integer number (146407871700).
Almost surely, 22301234344401 is an apocalyptic number.
It is an amenable number.
2301234344401 is a deficient number, since it is larger than the sum of its proper divisors (41291602799).
2301234344401 is a wasteful number, since it uses less digits than its factorization.
2301234344401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11568.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 2301234344401 its reverse (1044434321032), we get a palindrome (3345668665433).
The spelling of 2301234344401 in words is "two trillion, three hundred one billion, two hundred thirty-four million, three hundred forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •