Base | Representation |
---|---|
bin | 100111011010010001101… |
… | …0100111101001001010001 |
3 | 201011211001102202120010002 |
4 | 1032310203110331021101 |
5 | 1202221041343044040 |
6 | 15304154352415345 |
7 | 1066222033135106 |
oct | 116644324751121 |
9 | 21154042676102 |
10 | 5416546456145 |
11 | 17a91652a1300 |
12 | 73591a547555 |
13 | 303a16757c56 |
14 | 14a23b2c6aad |
15 | 95d6baa3a15 |
hex | 4ed2353d251 |
5416546456145 has 48 divisors (see below), whose sum is σ = 7391814086160. Its totient is φ = 3802962240000.
The previous prime is 5416546456129. The next prime is 5416546456169.
5416546456145 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 8 ways, for example, as 37468183489 + 5379078272656 = 193567^2 + 2319284^2 .
It is not a de Polignac number, because 5416546456145 - 24 = 5416546456129 is a prime.
It is a super-2 number, since 2×54165464561452 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 173697455 + ... + 173728635.
It is an arithmetic number, because the mean of its divisors is an integer number (153996126795).
Almost surely, 25416546456145 is an apocalyptic number.
5416546456145 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5416546456145 is a deficient number, since it is larger than the sum of its proper divisors (1975267630015).
5416546456145 is a wasteful number, since it uses less digits than its factorization.
5416546456145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41138 (or 41127 counting only the distinct ones).
The product of its digits is 34560000, while the sum is 56.
The spelling of 5416546456145 in words is "five trillion, four hundred sixteen billion, five hundred forty-six million, four hundred fifty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •