Base | Representation |
---|---|
bin | 1001100100110101… |
… | …00011110000001001 |
3 | 111021021022012112001 |
4 | 10302122203300021 |
5 | 41012020242111 |
6 | 2210040551001 |
7 | 241251665524 |
oct | 46232436011 |
9 | 14237265461 |
10 | 5140790281 |
11 | 21a8929910 |
12 | bb5782461 |
13 | 63c084853 |
14 | 36aa6dbbb |
15 | 2014b71c1 |
hex | 1326a3c09 |
5140790281 has 4 divisors (see below), whose sum is σ = 5608134864. Its totient is φ = 4673445700.
The previous prime is 5140790273. The next prime is 5140790341. The reversal of 5140790281 is 1820970415.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 5140790281 - 23 = 5140790273 is a prime.
It is a super-2 number, since 2×51407902812 = 52855449426448117922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5140790281.
It is not an unprimeable number, because it can be changed into a prime (5140790251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 233672275 + ... + 233672296.
It is an arithmetic number, because the mean of its divisors is an integer number (1402033716).
Almost surely, 25140790281 is an apocalyptic number.
It is an amenable number.
5140790281 is a deficient number, since it is larger than the sum of its proper divisors (467344583).
5140790281 is a wasteful number, since it uses less digits than its factorization.
5140790281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 467344582.
The product of its (nonzero) digits is 20160, while the sum is 37.
The square root of 5140790281 is about 71699.3046061118. The cubic root of 5140790281 is about 1725.8774818407.
The spelling of 5140790281 in words is "five billion, one hundred forty million, seven hundred ninety thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •