Base | Representation |
---|---|
bin | 100001110100100001… |
… | …0000111110011110111 |
3 | 20221110122111210110021 |
4 | 1003221002013303313 |
5 | 2142221023434333 |
6 | 53210530110011 |
7 | 5150550241126 |
oct | 1035102076367 |
9 | 227418453407 |
10 | 72629124343 |
11 | 2889027a106 |
12 | 120ab41b307 |
13 | 6b06046b29 |
14 | 372dc79abd |
15 | 1d5134582d |
hex | 10e9087cf7 |
72629124343 has 4 divisors (see below), whose sum is σ = 72637272808. Its totient is φ = 72620975880.
The previous prime is 72629124319. The next prime is 72629124371. The reversal of 72629124343 is 34342192627.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34342192627 = 15263 ⋅2250029.
It is a cyclic number.
It is not a de Polignac number, because 72629124343 - 213 = 72629116151 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 72629124343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (72629124383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4060848 + ... + 4078693.
It is an arithmetic number, because the mean of its divisors is an integer number (18159318202).
Almost surely, 272629124343 is an apocalyptic number.
72629124343 is a deficient number, since it is larger than the sum of its proper divisors (8148465).
72629124343 is an equidigital number, since it uses as much as digits as its factorization.
72629124343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8148464.
The product of its digits is 435456, while the sum is 43.
The spelling of 72629124343 in words is "seventy-two billion, six hundred twenty-nine million, one hundred twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •