Base | Representation |
---|---|
bin | 11001010100010111… |
… | …00111100000000101 |
3 | 1022002021212010120220 |
4 | 30222023213200011 |
5 | 210314200342331 |
6 | 10124440214553 |
7 | 660560053161 |
oct | 145213474005 |
9 | 38067763526 |
10 | 13592590341 |
11 | 5845732340 |
12 | 277416a459 |
13 | 13880a4a85 |
14 | 92d343ca1 |
15 | 5484a9296 |
hex | 32a2e7805 |
13592590341 has 16 divisors (see below), whose sum is σ = 19773042240. Its totient is φ = 8237099520.
The previous prime is 13592590273. The next prime is 13592590343. The reversal of 13592590341 is 14309529531.
It is not a de Polignac number, because 13592590341 - 27 = 13592590213 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13592590293 and 13592590302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13592590343) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 517461 + ... + 543093.
It is an arithmetic number, because the mean of its divisors is an integer number (1235815140).
Almost surely, 213592590341 is an apocalyptic number.
13592590341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13592590341 is a deficient number, since it is larger than the sum of its proper divisors (6180451899).
13592590341 is a wasteful number, since it uses less digits than its factorization.
13592590341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41716.
The product of its (nonzero) digits is 145800, while the sum is 42.
The spelling of 13592590341 in words is "thirteen billion, five hundred ninety-two million, five hundred ninety thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •