Base | Representation |
---|---|
bin | 10000011111101010111111… |
… | …101101100011111101111101 |
3 | 100111212020212200211121101010 |
4 | 100133222333231203331331 |
5 | 34002040044242142001 |
6 | 414142451121105433 |
7 | 21165135013612224 |
oct | 2037527755437575 |
9 | 314766780747333 |
10 | 72545214021501 |
11 | 2112a286079a21 |
12 | 81778b9488279 |
13 | 3162ca4753400 |
14 | 13cb2c8399cbb |
15 | 85c102c1d8d6 |
hex | 41fabfb63f7d |
72545214021501 has 12 divisors (see below), whose sum is σ = 104739835629408. Its totient is φ = 44643208628304.
The previous prime is 72545214021479. The next prime is 72545214021503. The reversal of 72545214021501 is 10512041254527.
It is not a de Polignac number, because 72545214021501 - 219 = 72545213497213 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 72545214021501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72545214021503) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71543603065 + ... + 71543604078.
It is an arithmetic number, because the mean of its divisors is an integer number (8728319635784).
Almost surely, 272545214021501 is an apocalyptic number.
It is an amenable number.
72545214021501 is a deficient number, since it is larger than the sum of its proper divisors (32194621607907).
72545214021501 is a wasteful number, since it uses less digits than its factorization.
72545214021501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143087207172 (or 143087207159 counting only the distinct ones).
The product of its (nonzero) digits is 112000, while the sum is 39.
The spelling of 72545214021501 in words is "seventy-two trillion, five hundred forty-five billion, two hundred fourteen million, twenty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •