Base | Representation |
---|---|
bin | 1100101100100100… |
… | …0100010111110111 |
3 | 22210112001001200220 |
4 | 3023021010113313 |
5 | 23434441331210 |
6 | 1322104305423 |
7 | 150312546240 |
oct | 31311042767 |
9 | 8715031626 |
10 | 3408152055 |
11 | 14998a40a0 |
12 | 7b1472273 |
13 | 42411b529 |
14 | 2448cdcc7 |
15 | 14e317c70 |
hex | cb2445f7 |
3408152055 has 64 divisors (see below), whose sum is σ = 6823443456. Its totient is φ = 1411200000.
The previous prime is 3408152023. The next prime is 3408152057. The reversal of 3408152055 is 5502518043.
It is not a de Polignac number, because 3408152055 - 25 = 3408152023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3408152057) 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 63 ways as a sum of consecutive naturals, for example, 319305 + ... + 329805.
It is an arithmetic number, because the mean of its divisors is an integer number (106616304).
Almost surely, 23408152055 is an apocalyptic number.
3408152055 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3408152055 is an abundant number, since it is smaller than the sum of its proper divisors (3415291401).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3408152055 is a wasteful number, since it uses less digits than its factorization.
3408152055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10808.
The product of its (nonzero) digits is 24000, while the sum is 33.
The square root of 3408152055 is about 58379.3803923954. The cubic root of 3408152055 is about 1504.8954214077.
The spelling of 3408152055 in words is "three billion, four hundred eight million, one hundred fifty-two thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •