Base | Representation |
---|---|
bin | 101011111111101000010… |
… | …111100100001001111001 |
3 | 101201000120020000010200101 |
4 | 223333220113210021321 |
5 | 344013114142004401 |
6 | 10232511112435401 |
7 | 431265133151455 |
oct | 53775027441171 |
9 | 11630506003611 |
10 | 3023260500601 |
11 | a661808110a0 |
12 | 409b179a8b61 |
13 | 18c12786a123 |
14 | a6480235665 |
15 | 5399685e101 |
hex | 2bfe85e4279 |
3023260500601 has 4 divisors (see below), whose sum is σ = 3298102364304. Its totient is φ = 2748418636900.
The previous prime is 3023260500577. The next prime is 3023260500613. The reversal of 3023260500601 is 1060050623203.
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 3023260500601 - 213 = 3023260492409 is a prime.
It is a super-2 number, since 2×30232605006012 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3023260500601.
It is not an unprimeable number, because it can be changed into a prime (3023260500671) 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, 137420931835 + ... + 137420931856.
It is an arithmetic number, because the mean of its divisors is an integer number (824525591076).
Almost surely, 23023260500601 is an apocalyptic number.
It is an amenable number.
3023260500601 is a deficient number, since it is larger than the sum of its proper divisors (274841863703).
3023260500601 is a wasteful number, since it uses less digits than its factorization.
3023260500601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 274841863702.
The product of its (nonzero) digits is 6480, while the sum is 28.
The spelling of 3023260500601 in words is "three trillion, twenty-three billion, two hundred sixty million, five hundred thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •