Base | Representation |
---|---|
bin | 111011101100000110001011… |
… | …0000011110100100011110001 |
3 | 2112211222101100102012120020001 |
4 | 1313120030112003310203301 |
5 | 1022304043024124443033 |
6 | 5100351251211550001 |
7 | 215406112156335211 |
oct | 16730142603644361 |
9 | 2484871312176201 |
10 | 525030057265393 |
11 | 142321aa6903769 |
12 | 4aa76413a5b301 |
13 | 196c6177c34104 |
14 | 9391839d34241 |
15 | 40a7383b41e7d |
hex | 1dd83160f48f1 |
525030057265393 has 8 divisors (see below), whose sum is σ = 531676649952000. Its totient is φ = 518383480643808.
The previous prime is 525030057265321. The next prime is 525030057265397. The reversal of 525030057265393 is 393562750030525.
It is a happy number.
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 525030057265393 - 241 = 522831034009841 is a prime.
It is a super-2 number, since 2×5250300572653932 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (525030057265397) 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, 70443405 + ... + 77539237.
It is an arithmetic number, because the mean of its divisors is an integer number (66459581244000).
Almost surely, 2525030057265393 is an apocalyptic number.
It is an amenable number.
525030057265393 is a deficient number, since it is larger than the sum of its proper divisors (6646592686607).
525030057265393 is an equidigital number, since it uses as much as digits as its factorization.
525030057265393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8032511.
The product of its (nonzero) digits is 25515000, while the sum is 55.
The spelling of 525030057265393 in words is "five hundred twenty-five trillion, thirty billion, fifty-seven million, two hundred sixty-five thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •