Base | Representation |
---|---|
bin | 1011010010100001… |
… | …1100010000110001 |
3 | 21211012102101000121 |
4 | 2310220130100301 |
5 | 22201302003101 |
6 | 1220414050241 |
7 | 135045554065 |
oct | 26450342061 |
9 | 7735371017 |
10 | 3030500401 |
11 | 1315702895 |
12 | 706aa9981 |
13 | 393b03206 |
14 | 20a6a5aa5 |
15 | 12b0bb0a1 |
hex | b4a1c431 |
3030500401 has 8 divisors (see below), whose sum is σ = 3181665600. Its totient is φ = 2880952272.
The previous prime is 3030500329. The next prime is 3030500423. The reversal of 3030500401 is 1040050303.
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 3030500401 - 221 = 3028403249 is a prime.
It is a super-2 number, since 2×30305004012 = 18367865360922321602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3030500441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 400426 + ... + 407923.
It is an arithmetic number, because the mean of its divisors is an integer number (397708200).
Almost surely, 23030500401 is an apocalyptic number.
It is an amenable number.
3030500401 is a deficient number, since it is larger than the sum of its proper divisors (151165199).
3030500401 is a wasteful number, since it uses less digits than its factorization.
3030500401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 808535.
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 3030500401 is about 55049.9809355099. The cubic root of 3030500401 is about 1447.1207869908.
Adding to 3030500401 its reverse (1040050303), we get a palindrome (4070550704).
The spelling of 3030500401 in words is "three billion, thirty million, five hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •