Base | Representation |
---|---|
bin | 101010111110101010011… |
… | …1011110101000101100001 |
3 | 202220201000100001012000001 |
4 | 1111331110323311011201 |
5 | 1233240021240031311 |
6 | 20321350213300001 |
7 | 1146524043034231 |
oct | 125752473650541 |
9 | 22821010035001 |
10 | 5907005002081 |
11 | 1978168368077 |
12 | 7b4998034601 |
13 | 33b049bb8001 |
14 | 165c8722bcc1 |
15 | a39c4c044c1 |
hex | 55f54ef5161 |
5907005002081 has 4 divisors (see below), whose sum is σ = 5964354565312. Its totient is φ = 5849655438852.
The previous prime is 5907005002061. The next prime is 5907005002103. The reversal of 5907005002081 is 1802005007095.
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 a cyclic number.
It is not a de Polignac number, because 5907005002081 - 229 = 5906468131169 is a prime.
It is a super-2 number, since 2×59070050020812 (a number of 26 digits) 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 5907005002081.
It is not an unprimeable number, because it can be changed into a prime (5907005002061) 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, 28674781461 + ... + 28674781666.
It is an arithmetic number, because the mean of its divisors is an integer number (1491088641328).
Almost surely, 25907005002081 is an apocalyptic number.
It is an amenable number.
5907005002081 is a deficient number, since it is larger than the sum of its proper divisors (57349563231).
5907005002081 is a wasteful number, since it uses less digits than its factorization.
5907005002081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57349563230.
The product of its (nonzero) digits is 25200, while the sum is 37.
The spelling of 5907005002081 in words is "five trillion, nine hundred seven billion, five million, two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •