Base | Representation |
---|---|
bin | 1011010011011001… |
… | …1000100110001101 |
3 | 21211110022001202010 |
4 | 2310312120212031 |
5 | 22203220433110 |
6 | 1221024251433 |
7 | 135121616061 |
oct | 26466304615 |
9 | 7743261663 |
10 | 3034155405 |
11 | 1317779956 |
12 | 708170b79 |
13 | 3947b2a38 |
14 | 20ad77aa1 |
15 | 12b58e020 |
hex | b4d9898d |
3034155405 has 16 divisors (see below), whose sum is σ = 4860455040. Its totient is φ = 1616280768.
The previous prime is 3034155403. The next prime is 3034155407. The reversal of 3034155405 is 5045514303.
3034155405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (3034155403) and next prime (3034155407).
It is not a de Polignac number, because 3034155405 - 21 = 3034155403 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3034155403) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107962 + ... + 133131.
It is an arithmetic number, because the mean of its divisors is an integer number (303778440).
Almost surely, 23034155405 is an apocalyptic number.
It is an amenable number.
3034155405 is a deficient number, since it is larger than the sum of its proper divisors (1826299635).
3034155405 is a wasteful number, since it uses less digits than its factorization.
3034155405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 241940.
The product of its (nonzero) digits is 18000, while the sum is 30.
The square root of 3034155405 is about 55083.1680733779. The cubic root of 3034155405 is about 1447.7023309153.
Adding to 3034155405 its reverse (5045514303), we get a palindrome (8079669708).
The spelling of 3034155405 in words is "three billion, thirty-four million, one hundred fifty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •