Base | Representation |
---|---|
bin | 1001101100001011… |
… | …1010010000111101 |
3 | 20201021200020200111 |
4 | 2123002322100331 |
5 | 20311403401141 |
6 | 1110041230021 |
7 | 121314050035 |
oct | 23302722075 |
9 | 6637606614 |
10 | 2601231421 |
11 | 1115366738 |
12 | 607192311 |
13 | 325bb45b9 |
14 | 1a96828c5 |
15 | 103575381 |
hex | 9b0ba43d |
2601231421 has 32 divisors (see below), whose sum is σ = 2894054400. Its totient is φ = 2327270400.
The previous prime is 2601231397. The next prime is 2601231427. The reversal of 2601231421 is 1241321062.
2601231421 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 2601231421 - 215 = 2601198653 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2601231392 and 2601231401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2601231427) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12328006 + ... + 12328216.
It is an arithmetic number, because the mean of its divisors is an integer number (90439200).
Almost surely, 22601231421 is an apocalyptic number.
It is an amenable number.
2601231421 is a deficient number, since it is larger than the sum of its proper divisors (292822979).
2601231421 is a wasteful number, since it uses less digits than its factorization.
2601231421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 565.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 2601231421 is about 51002.2687828689. The cubic root of 2601231421 is about 1375.2859211027.
Adding to 2601231421 its reverse (1241321062), we get a palindrome (3842552483).
The spelling of 2601231421 in words is "two billion, six hundred one million, two hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •