Base | Representation |
---|---|
bin | 101011010101001… |
… | …1000111101010011 |
3 | 10202022212110100121 |
4 | 1112222120331103 |
5 | 10434202442401 |
6 | 400135131111 |
7 | 51013252411 |
oct | 12652307523 |
9 | 3668773317 |
10 | 1453952851 |
11 | 68679a32a |
12 | 346b13a97 |
13 | 1a22bc140 |
14 | db1582b1 |
15 | 879a0ca1 |
hex | 56a98f53 |
1453952851 has 16 divisors (see below), whose sum is σ = 1645535584. Its totient is φ = 1275450624.
The previous prime is 1453952821. The next prime is 1453952879. The reversal of 1453952851 is 1582593541.
It is a cyclic number.
It is not a de Polignac number, because 1453952851 - 217 = 1453821779 is a prime.
It is a super-2 number, since 2×14539528512 = 4227957785862056402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1453952798 and 1453952807.
It is not an unprimeable number, because it can be changed into a prime (1453952821) 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 15 ways as a sum of consecutive naturals, for example, 14466 + ... + 55831.
It is an arithmetic number, because the mean of its divisors is an integer number (102845974).
Almost surely, 21453952851 is an apocalyptic number.
1453952851 is a deficient number, since it is larger than the sum of its proper divisors (191582733).
1453952851 is a wasteful number, since it uses less digits than its factorization.
1453952851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70390.
The product of its digits is 216000, while the sum is 43.
The square root of 1453952851 is about 38130.7336803267. The cubic root of 1453952851 is about 1132.8787775060.
The spelling of 1453952851 in words is "one billion, four hundred fifty-three million, nine hundred fifty-two thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •