Base | Representation |
---|---|
bin | 101000110110100010110… |
… | …011110110101000011101 |
3 | 100221101020201011200120212 |
4 | 220312202303312220131 |
5 | 331443420324141042 |
6 | 5545402045222205 |
7 | 406552426010051 |
oct | 50664263665035 |
9 | 10841221150525 |
10 | 2807345146397 |
11 | 992652169800 |
12 | 3940ba261965 |
13 | 1749681908cc |
14 | 99c3a537c61 |
15 | 4d05b064482 |
hex | 28da2cf6a1d |
2807345146397 has 6 divisors (see below), whose sum is σ = 3085759541214. Its totient is φ = 2552131951160.
The previous prime is 2807345146393. The next prime is 2807345146453. The reversal of 2807345146397 is 7936415437082.
It can be written as a sum of positive squares in only one way, i.e., 1985903826841 + 821441319556 = 1409221^2 + 906334^2 .
It is not a de Polignac number, because 2807345146397 - 22 = 2807345146393 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 (2807345146393) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11600599658 + ... + 11600599899.
It is an arithmetic number, because the mean of its divisors is an integer number (514293256869).
It is a 1-persistent number, because it is pandigital, but 2⋅2807345146397 = 5614690292794 is not.
Almost surely, 22807345146397 is an apocalyptic number.
It is an amenable number.
2807345146397 is a deficient number, since it is larger than the sum of its proper divisors (278414394817).
2807345146397 is a wasteful number, since it uses less digits than its factorization.
2807345146397 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23201199579 (or 23201199568 counting only the distinct ones).
The product of its (nonzero) digits is 30481920, while the sum is 59.
The spelling of 2807345146397 in words is "two trillion, eight hundred seven billion, three hundred forty-five million, one hundred forty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •