Base | Representation |
---|---|
bin | 1011011000011000… |
… | …0011101101111001 |
3 | 21212220121011221112 |
4 | 2312012003231321 |
5 | 22224042311101 |
6 | 1223052050105 |
7 | 135464265146 |
oct | 26606035571 |
9 | 7786534845 |
10 | 3055041401 |
11 | 1328544905 |
12 | 713163935 |
13 | 398c16509 |
14 | 20da533cd |
15 | 12d3176bb |
hex | b6183b79 |
3055041401 has 8 divisors (see below), whose sum is σ = 3199996800. Its totient is φ = 2911096672.
The previous prime is 3055041391. The next prime is 3055041421. The reversal of 3055041401 is 1041405503.
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 3055041401 - 218 = 3054779257 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3055041421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 246476 + ... + 258573.
It is an arithmetic number, because the mean of its divisors is an integer number (399999600).
Almost surely, 23055041401 is an apocalyptic number.
It is an amenable number.
3055041401 is a deficient number, since it is larger than the sum of its proper divisors (144955399).
3055041401 is a wasteful number, since it uses less digits than its factorization.
3055041401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505335.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 3055041401 is about 55272.4289406572. The cubic root of 3055041401 is about 1451.0165524774.
Adding to 3055041401 its reverse (1041405503), we get a palindrome (4096446904).
The spelling of 3055041401 in words is "three billion, fifty-five million, forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.484 sec. • engine limits •