Base | Representation |
---|---|
bin | 1001000110011110010… |
… | …0011101110110100100 |
3 | 112221120202012212221120 |
4 | 2101213210131312210 |
5 | 10030204221412424 |
6 | 155455033013540 |
7 | 14203441525533 |
oct | 2214744356644 |
9 | 487522185846 |
10 | 156356435364 |
11 | 6034614a118 |
12 | 263775542b0 |
13 | 1198a44560c |
14 | 77d3a6431a |
15 | 4101b72a79 |
hex | 246791dda4 |
156356435364 has 12 divisors (see below), whose sum is σ = 364831682544. Its totient is φ = 52118811784.
The previous prime is 156356435327. The next prime is 156356435371. The reversal of 156356435364 is 463534653651.
156356435364 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6514851462 + ... + 6514851485.
It is an arithmetic number, because the mean of its divisors is an integer number (30402640212).
Almost surely, 2156356435364 is an apocalyptic number.
It is an amenable number.
156356435364 is an abundant number, since it is smaller than the sum of its proper divisors (208475247180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156356435364 is a wasteful number, since it uses less digits than its factorization.
156356435364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13029702954 (or 13029702952 counting only the distinct ones).
The product of its digits is 11664000, while the sum is 51.
The spelling of 156356435364 in words is "one hundred fifty-six billion, three hundred fifty-six million, four hundred thirty-five thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •