Base | Representation |
---|---|
bin | 1101001100110000010… |
… | …00111111101101010101 |
3 | 1121100121212112101111221 |
4 | 12212120020333231111 |
5 | 24412304124423023 |
6 | 544202430330341 |
7 | 44523514625062 |
oct | 6463010775525 |
9 | 1540555471457 |
10 | 453524061013 |
11 | 16537a566671 |
12 | 73a903599b1 |
13 | 339c852036a |
14 | 17d44955c69 |
15 | bbe584e85d |
hex | 699823fb55 |
453524061013 has 4 divisors (see below), whose sum is σ = 454606457760. Its totient is φ = 452441664268.
The previous prime is 453524060971. The next prime is 453524061043. The reversal of 453524061013 is 310160425354.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 453524061013 - 29 = 453524060501 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 453524061013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (453524061043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 541197745 + ... + 541198582.
It is an arithmetic number, because the mean of its divisors is an integer number (113651614440).
Almost surely, 2453524061013 is an apocalyptic number.
It is an amenable number.
453524061013 is a deficient number, since it is larger than the sum of its proper divisors (1082396747).
453524061013 is a wasteful number, since it uses less digits than its factorization.
453524061013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1082396746.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 453524061013 its reverse (310160425354), we get a palindrome (763684486367).
The spelling of 453524061013 in words is "four hundred fifty-three billion, five hundred twenty-four million, sixty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •