Base | Representation |
---|---|
bin | 1100110110111010… |
… | …1010010011000000 |
3 | 22220112201110210020 |
4 | 3031232222103000 |
5 | 24032044424102 |
6 | 1330254533440 |
7 | 151350533334 |
oct | 31556522300 |
9 | 8815643706 |
10 | 3451561152 |
11 | 1511352a86 |
12 | 803b07280 |
13 | 4301099a0 |
14 | 24a58d7c4 |
15 | 15303ebbc |
hex | cdbaa4c0 |
3451561152 has 112 divisors (see below), whose sum is σ = 10063764480. Its totient is φ = 1037288448.
The previous prime is 3451561151. The next prime is 3451561181. The reversal of 3451561152 is 2511651543.
It is not an unprimeable number, because it can be changed into a prime (3451561151) 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, 91249 + ... + 123407.
It is an arithmetic number, because the mean of its divisors is an integer number (89855040).
Almost surely, 23451561152 is an apocalyptic number.
3451561152 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3451561152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5031882240).
3451561152 is an abundant number, since it is smaller than the sum of its proper divisors (6612203328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3451561152 is a wasteful number, since it uses less digits than its factorization.
3451561152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32230 (or 32220 counting only the distinct ones).
The product of its digits is 18000, while the sum is 33.
The square root of 3451561152 is about 58749.9885276585. The cubic root of 3451561152 is about 1511.2576911123.
The spelling of 3451561152 in words is "three billion, four hundred fifty-one million, five hundred sixty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •