Base | Representation |
---|---|
bin | 100101000010100111000… |
… | …100000100100011101000 |
3 | 100000100011221101112011122 |
4 | 211002213010010203220 |
5 | 313201011404022134 |
6 | 5225203523314412 |
7 | 351620652526160 |
oct | 45024704044350 |
9 | 10010157345148 |
10 | 2545423501544 |
11 | 8a1565231300 |
12 | 3513a121ba08 |
13 | 1560562729c1 |
14 | 8b2b06a35a0 |
15 | 4632b80602e |
hex | 250a71048e8 |
2545423501544 has 96 divisors (see below), whose sum is σ = 6310967678400. Its totient is φ = 939527424000.
The previous prime is 2545423501531. The next prime is 2545423501547. The reversal of 2545423501544 is 4451053245452.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a junction number, because it is equal to n+sod(n) for n = 2545423501495 and 2545423501504.
It is not an unprimeable number, because it can be changed into a prime (2545423501547) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9756857 + ... + 10014344.
It is an arithmetic number, because the mean of its divisors is an integer number (65739246650).
Almost surely, 22545423501544 is an apocalyptic number.
It is an amenable number.
2545423501544 is an abundant number, since it is smaller than the sum of its proper divisors (3765544176856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2545423501544 is a wasteful number, since it uses less digits than its factorization.
2545423501544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19771255 (or 19771240 counting only the distinct ones).
The product of its (nonzero) digits is 1920000, while the sum is 44.
Adding to 2545423501544 its reverse (4451053245452), we get a palindrome (6996476746996).
The spelling of 2545423501544 in words is "two trillion, five hundred forty-five billion, four hundred twenty-three million, five hundred one thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •