Base | Representation |
---|---|
bin | 1000011101010100… |
… | …11100001110111100 |
3 | 102201110122101021200 |
4 | 10032222130032330 |
5 | 33244442132022 |
6 | 2030332455500 |
7 | 220346433201 |
oct | 41652341674 |
9 | 12643571250 |
10 | 4540974012 |
11 | 1a20296a93 |
12 | a6891a590 |
13 | 574a21793 |
14 | 311133ca8 |
15 | 1b89d3bac |
hex | 10ea9c3bc |
4540974012 has 36 divisors (see below), whose sum is σ = 11480750736. Its totient is φ = 1513370880.
The previous prime is 4540973959. The next prime is 4540974013. The reversal of 4540974012 is 2104790454.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×45409740122 = 41240889955318752288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4540974013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 274233 + ... + 290319.
Almost surely, 24540974012 is an apocalyptic number.
It is an amenable number.
4540974012 is an abundant number, since it is smaller than the sum of its proper divisors (6939776724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4540974012 is a wasteful number, since it uses less digits than its factorization.
4540974012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23938 (or 23933 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 4540974012 is about 67386.7495283754. The cubic root of 4540974012 is about 1655.9593519043.
The spelling of 4540974012 in words is "four billion, five hundred forty million, nine hundred seventy-four thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •