Base | Representation |
---|---|
bin | 100110011001010000011… |
… | …1010101010011111011010 |
3 | 200200110122121010221201000 |
4 | 1030302200322222133122 |
5 | 1142424112402304232 |
6 | 15120103340005430 |
7 | 1053146662201320 |
oct | 114624072523732 |
9 | 20613577127630 |
10 | 5276919572442 |
11 | 1754a24590a41 |
12 | 712851830876 |
13 | 2c37c4283b3b |
14 | 143593461d10 |
15 | 923e89d527c |
hex | 4cca0eaa7da |
5276919572442 has 32 divisors (see below), whose sum is σ = 13401700502400. Its totient is φ = 1507691306304.
The previous prime is 5276919572437. The next prime is 5276919572443. The reversal of 5276919572442 is 2442759196725.
It is a happy number.
5276919572442 is a `hidden beast` number, since 5 + 2 + 7 + 6 + 9 + 19 + 572 + 4 + 42 = 666.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a self number, because there is not a number n which added to its sum of digits gives 5276919572442.
It is not an unprimeable number, because it can be changed into a prime (5276919572443) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6980051967 + ... + 6980052722.
It is an arithmetic number, because the mean of its divisors is an integer number (418803140700).
Almost surely, 25276919572442 is an apocalyptic number.
5276919572442 is an abundant number, since it is smaller than the sum of its proper divisors (8124780929958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5276919572442 is a wasteful number, since it uses less digits than its factorization.
5276919572442 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13960104707 (or 13960104701 counting only the distinct ones).
The product of its digits is 76204800, while the sum is 63.
The spelling of 5276919572442 in words is "five trillion, two hundred seventy-six billion, nine hundred nineteen million, five hundred seventy-two thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •