Base | Representation |
---|---|
bin | 10000011000000010100110… |
… | …00111011010100100011110 |
3 | 11201111120010201011101100011 |
4 | 20030001103013122210132 |
5 | 14204443244431344210 |
6 | 204330541031553434 |
7 | 10404444200566246 |
oct | 1014012307324436 |
9 | 151446121141304 |
10 | 36010400262430 |
11 | 10523a1a182610 |
12 | 405708222b87a |
13 | 17129c6390389 |
14 | 8c6cac530b26 |
15 | 426aa6d35d8a |
hex | 20c0531da91e |
36010400262430 has 16 divisors (see below), whose sum is σ = 70711331424624. Its totient is φ = 13094691004480.
The previous prime is 36010400262413. The next prime is 36010400262437. The reversal of 36010400262430 is 3426200401063.
It is a super-2 number, since 2×360104002624302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 36010400262392 and 36010400262401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36010400262437) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 163683637447 + ... + 163683637666.
It is an arithmetic number, because the mean of its divisors is an integer number (4419458214039).
Almost surely, 236010400262430 is an apocalyptic number.
36010400262430 is a deficient number, since it is larger than the sum of its proper divisors (34700931162194).
36010400262430 is a wasteful number, since it uses less digits than its factorization.
36010400262430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327367275131.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 36010400262430 its reverse (3426200401063), we get a palindrome (39436600663493).
The spelling of 36010400262430 in words is "thirty-six trillion, ten billion, four hundred million, two hundred sixty-two thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •