Base | Representation |
---|---|
bin | 10100101011100100010111… |
… | …01000110011000011110000 |
3 | 12222000121021010121021000000 |
4 | 22111302023220303003300 |
5 | 21430100312323123333 |
6 | 240420015521430000 |
7 | 12402431523533103 |
oct | 1225621350630360 |
9 | 188017233537000 |
10 | 45477456457968 |
11 | 13543976637257 |
12 | 5125a0419b300 |
13 | 1c4b6761688c2 |
14 | b3319905673a |
15 | 53ce8dd78713 |
hex | 295c8ba330f0 |
45477456457968 has 70 divisors (see below), whose sum is σ = 132108424002104. Its totient is φ = 15159152148768.
The previous prime is 45477456457943. The next prime is 45477456457969. The reversal of 45477456457968 is 86975465477454.
45477456457968 is a `hidden beast` number, since 4 + 5 + 4 + 7 + 74 + 5 + 6 + 457 + 96 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (81).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45477456457969) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 1949467780 + ... + 1949491107.
Almost surely, 245477456457968 is an apocalyptic number.
45477456457968 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
45477456457968 is an abundant number, since it is smaller than the sum of its proper divisors (86630967544136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
45477456457968 is an equidigital number, since it uses as much as digits as its factorization.
45477456457968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3898958913 (or 3898958892 counting only the distinct ones).
The product of its digits is 28449792000, while the sum is 81.
The spelling of 45477456457968 in words is "forty-five trillion, four hundred seventy-seven billion, four hundred fifty-six million, four hundred fifty-seven thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •