Base | Representation |
---|---|
bin | 10111010111101101001… |
… | …10011111001011100101 |
3 | 2211202200112102120022100 |
4 | 23223312212133023211 |
5 | 101124021301421011 |
6 | 1412521010322313 |
7 | 112005055410201 |
oct | 13536646371345 |
9 | 2752615376270 |
10 | 803001201381 |
11 | 28a607275815 |
12 | 10b763589399 |
13 | 5a951991992 |
14 | 2ac18ba1b01 |
15 | 15d4ba21d56 |
hex | baf699f2e5 |
803001201381 has 12 divisors (see below), whose sum is σ = 1178905225420. Its totient is φ = 526558164480.
The previous prime is 803001201347. The next prime is 803001201383. The reversal of 803001201381 is 183102100308.
803001201381 is a `hidden beast` number, since 80 + 3 + 0 + 0 + 1 + 201 + 381 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 230544022500 + 572457178881 = 480150^2 + 756609^2 .
It is not a de Polignac number, because 803001201381 - 210 = 803001200357 is a prime.
It is a super-2 number, since 2×8030012013812 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (803001201383) 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, 731330236 + ... + 731331333.
Almost surely, 2803001201381 is an apocalyptic number.
It is an amenable number.
803001201381 is a deficient number, since it is larger than the sum of its proper divisors (375904024039).
803001201381 is a wasteful number, since it uses less digits than its factorization.
803001201381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462661636 (or 1462661633 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
Adding to 803001201381 its reverse (183102100308), we get a palindrome (986103301689).
The spelling of 803001201381 in words is "eight hundred three billion, one million, two hundred one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •