Base | Representation |
---|---|
bin | 111010010110111111100011… |
… | …0101110000101101101010111 |
3 | 2111022120012120100000221011221 |
4 | 1310231333012232011231113 |
5 | 1014240424032214041044 |
6 | 5015434100200311211 |
7 | 213061060264020316 |
oct | 16455770656055527 |
9 | 2438505510027157 |
10 | 513333530221399 |
11 | 139622589261438 |
12 | 496a7588772507 |
13 | 190581b4a310a4 |
14 | 90a969281627d |
15 | 3e52eb3249484 |
hex | 1d2dfc6b85b57 |
513333530221399 has 8 divisors (see below), whose sum is σ = 531863133703920. Its totient is φ = 494859156556800.
The previous prime is 513333530221397. The next prime is 513333530221409. The reversal of 513333530221399 is 993122035333315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 513333530221399 - 21 = 513333530221397 is a prime.
It is a super-2 number, since 2×5133335302213992 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513333530221397) 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, 13807435557 + ... + 13807472734.
It is an arithmetic number, because the mean of its divisors is an integer number (66482891712990).
Almost surely, 2513333530221399 is an apocalyptic number.
513333530221399 is a deficient number, since it is larger than the sum of its proper divisors (18529603482521).
513333530221399 is a wasteful number, since it uses less digits than its factorization.
513333530221399 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27614908961.
The product of its (nonzero) digits is 5904900, while the sum is 52.
The spelling of 513333530221399 in words is "five hundred thirteen trillion, three hundred thirty-three billion, five hundred thirty million, two hundred twenty-one thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •