Base | Representation |
---|---|
bin | 1000101111110011… |
… | …1010100001011001 |
3 | 20001122011211100200 |
4 | 2023330322201121 |
5 | 14302042020434 |
6 | 1024553452413 |
7 | 112120453020 |
oct | 21374724131 |
9 | 6048154320 |
10 | 2348001369 |
11 | aa54271aa |
12 | 556411109 |
13 | 2b55b092c |
14 | 183ba58b7 |
15 | db204199 |
hex | 8bf3a859 |
2348001369 has 48 divisors (see below), whose sum is σ = 3977385984. Its totient is φ = 1306821600.
The previous prime is 2348001367. The next prime is 2348001371. The reversal of 2348001369 is 9631008432.
It is an interprime number because it is at equal distance from previous prime (2348001367) and next prime (2348001371).
It is not a de Polignac number, because 2348001369 - 21 = 2348001367 is a prime.
It is a super-2 number, since 2×23480013692 = 11026220857651748322, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2348001367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1166574 + ... + 1168584.
It is an arithmetic number, because the mean of its divisors is an integer number (82862208).
Almost surely, 22348001369 is an apocalyptic number.
It is an amenable number.
2348001369 is a deficient number, since it is larger than the sum of its proper divisors (1629384615).
2348001369 is a wasteful number, since it uses less digits than its factorization.
2348001369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2498 (or 2495 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The square root of 2348001369 is about 48456.1798845101. The cubic root of 2348001369 is about 1329.1258825604.
The spelling of 2348001369 in words is "two billion, three hundred forty-eight million, one thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •