Base | Representation |
---|---|
bin | 10100100110110100001000… |
… | …10101001000101101010001 |
3 | 12221102222200021211220012220 |
4 | 22103122010111020231101 |
5 | 21414411312011343001 |
6 | 240213004404011253 |
7 | 12354560156125353 |
oct | 1223320425105521 |
9 | 187388607756186 |
10 | 45314125106001 |
11 | 13490681316054 |
12 | 50ba220990b29 |
13 | 1c391469904cb |
14 | b29302d250d3 |
15 | 538acebe3c36 |
hex | 293684548b51 |
45314125106001 has 32 divisors (see below), whose sum is σ = 62316646576128. Its totient is φ = 29270913490560.
The previous prime is 45314125105943. The next prime is 45314125106071. The reversal of 45314125106001 is 10060152141354.
It is not a de Polignac number, because 45314125106001 - 26 = 45314125105937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (45314125106071) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 22940760 + ... + 24837606.
It is an arithmetic number, because the mean of its divisors is an integer number (1947395205504).
Almost surely, 245314125106001 is an apocalyptic number.
45314125106001 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
45314125106001 is a deficient number, since it is larger than the sum of its proper divisors (17002521470127).
45314125106001 is a wasteful number, since it uses less digits than its factorization.
45314125106001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1898221.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 45314125106001 its reverse (10060152141354), we get a palindrome (55374277247355).
The spelling of 45314125106001 in words is "forty-five trillion, three hundred fourteen billion, one hundred twenty-five million, one hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •