Base | Representation |
---|---|
bin | 11101011100001101010… |
… | …001010100101011010001 |
3 | 21011102002221212120102212 |
4 | 131130031101110223101 |
5 | 231121403433210421 |
6 | 4145231233521505 |
7 | 266111412211016 |
oct | 35341521245321 |
9 | 7142087776385 |
10 | 2023152241361 |
11 | 710017773459 |
12 | 288125713295 |
13 | 118a23028684 |
14 | 6dcc768b70d |
15 | 37960860e5b |
hex | 1d70d454ad1 |
2023152241361 has 8 divisors (see below), whose sum is σ = 2052157866048. Its totient is φ = 1994160798000.
The previous prime is 2023152241349. The next prime is 2023152241373. The reversal of 2023152241361 is 1631422513202.
It is an interprime number because it is at equal distance from previous prime (2023152241349) and next prime (2023152241373).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2023152241361 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2023152241301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3257795 + ... + 3828776.
It is an arithmetic number, because the mean of its divisors is an integer number (256519733256).
Almost surely, 22023152241361 is an apocalyptic number.
It is an amenable number.
2023152241361 is a deficient number, since it is larger than the sum of its proper divisors (29005624687).
2023152241361 is an equidigital number, since it uses as much as digits as its factorization.
2023152241361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7090663.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 2023152241361 its reverse (1631422513202), we get a palindrome (3654574754563).
The spelling of 2023152241361 in words is "two trillion, twenty-three billion, one hundred fifty-two million, two hundred forty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •