Base | Representation |
---|---|
bin | 100111001001011001… |
… | …011101100111001100 |
3 | 11000111101122011121000 |
4 | 213021121131213030 |
5 | 1142041100212342 |
6 | 31150541540300 |
7 | 3015426466416 |
oct | 471131354714 |
9 | 130441564530 |
10 | 42033600972 |
11 | 1690a965600 |
12 | 8190b74690 |
13 | 3c6b49294c |
14 | 206a6d19b6 |
15 | 11602d544c |
hex | 9c965d9cc |
42033600972 has 576 divisors, whose sum is σ = 134230835200. Its totient is φ = 11316412800.
The previous prime is 42033600923. The next prime is 42033600989. The reversal of 42033600972 is 27900633024.
It is a happy number.
42033600972 is a `hidden beast` number, since 4 + 203 + 360 + 0 + 97 + 2 = 666.
It is a super-2 number, since 2×420336009722 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 191 ways as a sum of consecutive naturals, for example, 330973173 + ... + 330973299.
Almost surely, 242033600972 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42033600972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67115417600).
42033600972 is an abundant number, since it is smaller than the sum of its proper divisors (92197234228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42033600972 is a wasteful number, since it uses less digits than its factorization.
42033600972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255 (or 236 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 36.
The spelling of 42033600972 in words is "forty-two billion, thirty-three million, six hundred thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •