Base | Representation |
---|---|
bin | 11001101010101101110001… |
… | …01001111011110011111100 |
3 | 21101211220221001200100122210 |
4 | 30311112320221323303330 |
5 | 24344231300342043442 |
6 | 320013402133540420 |
7 | 14613614452323564 |
oct | 1465267051736374 |
9 | 241756831610583 |
10 | 56443263237372 |
11 | 16a914a9696470 |
12 | 63b70ba7a4710 |
13 | 256576655383b |
14 | dd1c232d3da4 |
15 | 67d34371819c |
hex | 3355b8a7bcfc |
56443263237372 has 384 divisors, whose sum is σ = 155764213678080. Its totient is φ = 15729867648000.
The previous prime is 56443263237359. The next prime is 56443263237373. The reversal of 56443263237372 is 27373236234465.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56443263237373) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9696486222 + ... + 9696492042.
It is an arithmetic number, because the mean of its divisors is an integer number (405635973120).
Almost surely, 256443263237372 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56443263237372, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77882106839040).
56443263237372 is an abundant number, since it is smaller than the sum of its proper divisors (99320950440708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56443263237372 is a wasteful number, since it uses less digits than its factorization.
56443263237372 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6545 (or 6543 counting only the distinct ones).
The product of its digits is 91445760, while the sum is 57.
The spelling of 56443263237372 in words is "fifty-six trillion, four hundred forty-three billion, two hundred sixty-three million, two hundred thirty-seven thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •