Base | Representation |
---|---|
bin | 100001111011010101111… |
… | …100010110010001111101 |
3 | 22020212220120101212001210 |
4 | 201323111330112101331 |
5 | 301144313140010331 |
6 | 4543020402155033 |
7 | 330304535653320 |
oct | 41732574262175 |
9 | 8225816355053 |
10 | 2331461641341 |
11 | 819849351968 |
12 | 317a29952a79 |
13 | 13bb185098b1 |
14 | 80bb41d67b7 |
15 | 409a7784446 |
hex | 21ed5f1647d |
2331461641341 has 32 divisors (see below), whose sum is σ = 3840760514560. Its totient is φ = 1228032622656.
The previous prime is 2331461641309. The next prime is 2331461641351. The reversal of 2331461641341 is 1431461641332.
It is not a de Polignac number, because 2331461641341 - 25 = 2331461641309 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2331461641341.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2331461641351) 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, 78948241 + ... + 78977766.
It is an arithmetic number, because the mean of its divisors is an integer number (120023766080).
Almost surely, 22331461641341 is an apocalyptic number.
2331461641341 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2331461641341 is a deficient number, since it is larger than the sum of its proper divisors (1509298873219).
2331461641341 is a wasteful number, since it uses less digits than its factorization.
2331461641341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 157926073.
The product of its digits is 124416, while the sum is 39.
Subtracting from 2331461641341 its reverse (1431461641332), we obtain a palindrome (900000000009).
The spelling of 2331461641341 in words is "two trillion, three hundred thirty-one billion, four hundred sixty-one million, six hundred forty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •