Base | Representation |
---|---|
bin | 101000001111100… |
… | …0111000000100011 |
3 | 10111002212222220000 |
4 | 1100133013000203 |
5 | 10231141114301 |
6 | 341554151043 |
7 | 45314431206 |
oct | 12037070043 |
9 | 3432788800 |
10 | 1350332451 |
11 | 633255836 |
12 | 318282483 |
13 | 1869ab7b0 |
14 | cb4a393d |
15 | 7d833786 |
hex | 507c7023 |
1350332451 has 40 divisors (see below), whose sum is σ = 2286696720. Its totient is φ = 787226688.
The previous prime is 1350332447. The next prime is 1350332479. The reversal of 1350332451 is 1542330531.
It is not a de Polignac number, because 1350332451 - 22 = 1350332447 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1350332651) 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 39 ways as a sum of consecutive naturals, for example, 13740 + ... + 53753.
It is an arithmetic number, because the mean of its divisors is an integer number (57167418).
Almost surely, 21350332451 is an apocalyptic number.
1350332451 is a deficient number, since it is larger than the sum of its proper divisors (936364269).
1350332451 is a wasteful number, since it uses less digits than its factorization.
1350332451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67537 (or 67528 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 1350332451 is about 36746.8699483371. The cubic root of 1350332451 is about 1105.3001651057.
Adding to 1350332451 its reverse (1542330531), we get a palindrome (2892662982).
It can be divided in two parts, 13503 and 32451, that added together give a palindrome (45954).
The spelling of 1350332451 in words is "one billion, three hundred fifty million, three hundred thirty-two thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •