Base | Representation |
---|---|
bin | 101010100100110001… |
… | …001000000010010000 |
3 | 11100222212222112121200 |
4 | 222210301020002100 |
5 | 1222110241424402 |
6 | 33000053551200 |
7 | 3205556465526 |
oct | 524461100220 |
9 | 140885875550 |
10 | 45714014352 |
11 | 18429407656 |
12 | 8a39645500 |
13 | 4406b19346 |
14 | 22d9414316 |
15 | 12c847d21c |
hex | aa4c48090 |
45714014352 has 60 divisors (see below), whose sum is σ = 127953011004. Its totient is φ = 15235948800.
The previous prime is 45714014351. The next prime is 45714014417. The reversal of 45714014352 is 25341041754.
45714014352 is a `hidden beast` number, since 4 + 571 + 40 + 1 + 43 + 5 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 18560247696 + 27153766656 = 136236^2 + 164784^2 .
It is a super-2 number, since 2×457140143522 (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 not an unprimeable number, because it can be changed into a prime (45714014351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1356102 + ... + 1389402.
Almost surely, 245714014352 is an apocalyptic number.
It is an amenable number.
45714014352 is an abundant number, since it is smaller than the sum of its proper divisors (82238996652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45714014352 is a wasteful number, since it uses less digits than its factorization.
45714014352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42848 (or 42839 counting only the distinct ones).
The product of its (nonzero) digits is 67200, while the sum is 36.
The spelling of 45714014352 in words is "forty-five billion, seven hundred fourteen million, fourteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •