Base | Representation |
---|---|
bin | 111100110000010011111101… |
… | …0100111010110001000001011 |
3 | 2121002011200000212100222012020 |
4 | 1321200213322213112020023 |
5 | 1030021144441132014201 |
6 | 5132330300254415523 |
7 | 220364344506313461 |
oct | 17140477247261013 |
9 | 2532150025328166 |
10 | 534405510423051 |
11 | 145307116790223 |
12 | 4bb2b4502015a3 |
13 | 19c262b9a5c947 |
14 | 95d7516ab6831 |
15 | 41bb1a8c08a36 |
hex | 1e609fa9d620b |
534405510423051 has 8 divisors (see below), whose sum is σ = 715249960719360. Its totient is φ = 354915700204392.
The previous prime is 534405510423019. The next prime is 534405510423053. The reversal of 534405510423051 is 150324015504435.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 534405510423051 - 25 = 534405510423019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 534405510422994 and 534405510423012.
It is not an unprimeable number, because it can be changed into a prime (534405510423053) 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, 338660018491 + ... + 338660020068.
It is an arithmetic number, because the mean of its divisors is an integer number (89406245089920).
Almost surely, 2534405510423051 is an apocalyptic number.
534405510423051 is a deficient number, since it is larger than the sum of its proper divisors (180844450296309).
534405510423051 is a wasteful number, since it uses less digits than its factorization.
534405510423051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 677320038825.
The product of its (nonzero) digits is 720000, while the sum is 42.
Adding to 534405510423051 its reverse (150324015504435), we get a palindrome (684729525927486).
The spelling of 534405510423051 in words is "five hundred thirty-four trillion, four hundred five billion, five hundred ten million, four hundred twenty-three thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •