Base | Representation |
---|---|
bin | 1101001011111111001… |
… | …01101100110100101001 |
3 | 1121022120011110102021201 |
4 | 12211333211230310221 |
5 | 24410433202433213 |
6 | 544053514004201 |
7 | 44510353526140 |
oct | 6457745546451 |
9 | 1538504412251 |
10 | 453112155433 |
11 | 165188aa9933 |
12 | 73996416661 |
13 | 339610a0a52 |
14 | 17d05d72757 |
15 | bbbe5d86dd |
hex | 697f96cd29 |
453112155433 has 16 divisors (see below), whose sum is σ = 534713840640. Its totient is φ = 375736132800.
The previous prime is 453112155409. The next prime is 453112155437. The reversal of 453112155433 is 334551211354.
It is not a de Polignac number, because 453112155433 - 29 = 453112154921 is a prime.
It is a super-2 number, since 2×4531121554332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 453112155392 and 453112155401.
It is not an unprimeable number, because it can be changed into a prime (453112155437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 374823 + ... + 1023091.
It is an arithmetic number, because the mean of its divisors is an integer number (33419615040).
Almost surely, 2453112155433 is an apocalyptic number.
It is an amenable number.
453112155433 is a deficient number, since it is larger than the sum of its proper divisors (81601685207).
453112155433 is a wasteful number, since it uses less digits than its factorization.
453112155433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651528.
The product of its digits is 108000, while the sum is 37.
Adding to 453112155433 its reverse (334551211354), we get a palindrome (787663366787).
The spelling of 453112155433 in words is "four hundred fifty-three billion, one hundred twelve million, one hundred fifty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •