Base | Representation |
---|---|
bin | 101000100010001000010111… |
… | …0011100100110000100100001 |
3 | 1201202101101010121011222001221 |
4 | 1101010100232130212010201 |
5 | 333212430332213022312 |
6 | 3302141423000455041 |
7 | 135045526603306015 |
oct | 12104205634460441 |
9 | 1652341117158057 |
10 | 356534604423457 |
11 | a366a5273a4a29 |
12 | 33ba296577a481 |
13 | 123c30b85a6255 |
14 | 640851cbca545 |
15 | 2b3443b02c207 |
hex | 144442e726121 |
356534604423457 has 2 divisors, whose sum is σ = 356534604423458. Its totient is φ = 356534604423456.
The previous prime is 356534604423367. The next prime is 356534604423539. The reversal of 356534604423457 is 754324406435653.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 230691170167441 + 125843434256016 = 15188521^2 + 11217996^2 .
It is a cyclic number.
It is not a de Polignac number, because 356534604423457 - 27 = 356534604423329 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 356534604423395 and 356534604423404.
It is not a weakly prime, because it can be changed into another prime (356534604423157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 178267302211728 + 178267302211729.
It is an arithmetic number, because the mean of its divisors is an integer number (178267302211729).
Almost surely, 2356534604423457 is an apocalyptic number.
It is an amenable number.
356534604423457 is a deficient number, since it is larger than the sum of its proper divisors (1).
356534604423457 is an equidigital number, since it uses as much as digits as its factorization.
356534604423457 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 435456000, while the sum is 61.
The spelling of 356534604423457 in words is "three hundred fifty-six trillion, five hundred thirty-four billion, six hundred four million, four hundred twenty-three thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •