Base | Representation |
---|---|
bin | 101011001111100… |
… | …1111111111100110 |
3 | 10202010101002110022 |
4 | 1112133033333212 |
5 | 10432431020200 |
6 | 355552355142 |
7 | 50646400412 |
oct | 12637177746 |
9 | 3663332408 |
10 | 1451032550 |
11 | 685085260 |
12 | 345b45ab2 |
13 | 1a1808b56 |
14 | da9d7d42 |
15 | 875c5885 |
hex | 567cffe6 |
1451032550 has 48 divisors (see below), whose sum is σ = 2953150272. Its totient is φ = 526058400.
The previous prime is 1451032547. The next prime is 1451032553. The reversal of 1451032550 is 552301541.
It is an interprime number because it is at equal distance from previous prime (1451032547) and next prime (1451032553).
It is a super-2 number, since 2×14510325502 = 4210990922319005000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1451032553) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 187049 + ... + 194651.
It is an arithmetic number, because the mean of its divisors is an integer number (61523964).
Almost surely, 21451032550 is an apocalyptic number.
1451032550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1451032550 is an abundant number, since it is smaller than the sum of its proper divisors (1502117722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451032550 is a wasteful number, since it uses less digits than its factorization.
1451032550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7973 (or 7968 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 1451032550 is about 38092.4211622207. The cubic root of 1451032550 is about 1132.1197972623.
The spelling of 1451032550 in words is "one billion, four hundred fifty-one million, thirty-two thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •