Base | Representation |
---|---|
bin | 1010100110111100… |
… | …11011111100100100 |
3 | 112200221000002111020 |
4 | 11103132123330210 |
5 | 43131014030022 |
6 | 2341053211140 |
7 | 261065366052 |
oct | 52336337444 |
9 | 15627002436 |
10 | 5695455012 |
11 | 2462a32715 |
12 | 112b490ab0 |
13 | 6c9c69330 |
14 | 3c05b51d2 |
15 | 23502c35c |
hex | 15379bf24 |
5695455012 has 48 divisors (see below), whose sum is σ = 14318270400. Its totient is φ = 1751637888.
The previous prime is 5695454987. The next prime is 5695455019. The reversal of 5695455012 is 2105545965.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (5695455019) 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 15 ways as a sum of consecutive naturals, for example, 390483 + ... + 404805.
It is an arithmetic number, because the mean of its divisors is an integer number (298297300).
Almost surely, 25695455012 is an apocalyptic number.
5695455012 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5695455012 is an abundant number, since it is smaller than the sum of its proper divisors (8622815388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5695455012 is a wasteful number, since it uses less digits than its factorization.
5695455012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16892 (or 16890 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 42.
The square root of 5695455012 is about 75468.2384318065. The cubic root of 5695455012 is about 1785.8410787276.
The spelling of 5695455012 in words is "five billion, six hundred ninety-five million, four hundred fifty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •