Base | Representation |
---|---|
bin | 1011010101000010… |
… | …0011100110010111 |
3 | 21211221012122000012 |
4 | 2311100203212113 |
5 | 22212000004330 |
6 | 1221431310435 |
7 | 135234132326 |
oct | 26520434627 |
9 | 7757178005 |
10 | 3041016215 |
11 | 1320635546 |
12 | 70a51b41b |
13 | 3960457a3 |
14 | 20bc420bd |
15 | 12be96c95 |
hex | b5423997 |
3041016215 has 8 divisors (see below), whose sum is σ = 3841283760. Its totient is φ = 2304770112.
The previous prime is 3041016211. The next prime is 3041016221. The reversal of 3041016215 is 5126101403.
3041016215 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3041016215 - 22 = 3041016211 is a prime.
It is a super-3 number, since 3×30410162153 (a number of 29 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3041016211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16005254 + ... + 16005443.
It is an arithmetic number, because the mean of its divisors is an integer number (480160470).
Almost surely, 23041016215 is an apocalyptic number.
3041016215 is a deficient number, since it is larger than the sum of its proper divisors (800267545).
3041016215 is a wasteful number, since it uses less digits than its factorization.
3041016215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32010721.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 3041016215 is about 55145.4097364413. The cubic root of 3041016215 is about 1448.7926874648.
Adding to 3041016215 its reverse (5126101403), we get a palindrome (8167117618).
The spelling of 3041016215 in words is "three billion, forty-one million, sixteen thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •