Base | Representation |
---|---|
bin | 1001001000001101000010… |
… | …0011011101110010011000 |
3 | 1022112111001220111201020120 |
4 | 2102003100203131302120 |
5 | 2303414314343431212 |
6 | 33202420214553240 |
7 | 2054054611112262 |
oct | 222032043356230 |
9 | 38474056451216 |
10 | 10036542561432 |
11 | 321a523695312 |
12 | 1161195968820 |
13 | 57a598b23b3a |
14 | 269ab245ab32 |
15 | 12611812888c |
hex | 920d08ddc98 |
10036542561432 has 32 divisors (see below), whose sum is σ = 25103735092800. Its totient is φ = 3343863695264.
The previous prime is 10036542561359. The next prime is 10036542561433. The reversal of 10036542561432 is 23416524563001.
It is a super-2 number, since 2×100365425614322 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10036542561433) 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, 103106082 + ... + 103203377.
It is an arithmetic number, because the mean of its divisors is an integer number (784491721650).
Almost surely, 210036542561432 is an apocalyptic number.
10036542561432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10036542561432 is an abundant number, since it is smaller than the sum of its proper divisors (15067192531368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10036542561432 is a wasteful number, since it uses less digits than its factorization.
10036542561432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206311495 (or 206311491 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 10036542561432 in words is "ten trillion, thirty-six billion, five hundred forty-two million, five hundred sixty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •