Base | Representation |
---|---|
bin | 1010101000001110… |
… | …0010101110100101 |
3 | 21100211112020020102 |
4 | 2222003202232211 |
5 | 21320340233042 |
6 | 1151034513445 |
7 | 130462366523 |
oct | 25203425645 |
9 | 7324466212 |
10 | 2853055397 |
11 | 1234525825 |
12 | 677595885 |
13 | 36611527a |
14 | 1d0cb5313 |
15 | 11a719b32 |
hex | aa0e2ba5 |
2853055397 has 12 divisors (see below), whose sum is σ = 2940809508. Its totient is φ = 2767795200.
The previous prime is 2853055391. The next prime is 2853055483. The reversal of 2853055397 is 7935503582.
It is a happy number.
It is a Cunningham number, because it is equal to 534142+1.
It can be written as a sum of positive squares in 6 ways, for example, as 2329606756 + 523448641 = 48266^2 + 22879^2 .
It is not a de Polignac number, because 2853055397 - 212 = 2853051301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2853055391) 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, 299573 + ... + 308949.
It is an arithmetic number, because the mean of its divisors is an integer number (245067459).
Almost surely, 22853055397 is an apocalyptic number.
It is an amenable number.
2853055397 is a deficient number, since it is larger than the sum of its proper divisors (87754111).
2853055397 is an equidigital number, since it uses as much as digits as its factorization.
2853055397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9640 (or 9599 counting only the distinct ones).
The product of its (nonzero) digits is 1134000, while the sum is 47.
The square root of 2853055397 is about 53414.0000093608. Note that the first 5 decimals coincide. The cubic root of 2853055397 is about 1418.3064179130.
The spelling of 2853055397 in words is "two billion, eight hundred fifty-three million, fifty-five thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •