Base | Representation |
---|---|
bin | 11111001101000011001… |
… | …01001000001101010101 |
3 | 10210111102111220110201010 |
4 | 33212201211020031111 |
5 | 120031234334041204 |
6 | 2140313100522433 |
7 | 140314032156504 |
oct | 17464145101525 |
9 | 3714374813633 |
10 | 1072157721429 |
11 | 3837770a0013 |
12 | 15395b550419 |
13 | 7a147760b22 |
14 | 39c6d85283b |
15 | 1cd514e1d89 |
hex | f9a1948355 |
1072157721429 has 8 divisors (see below), whose sum is σ = 1452978770272. Its totient is φ = 703054243440.
The previous prime is 1072157721413. The next prime is 1072157721449. The reversal of 1072157721429 is 9241277512701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1072157721429 - 24 = 1072157721413 is a prime.
It is a super-2 number, since 2×10721577214292 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1072157721409) 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 7 ways as a sum of consecutive naturals, for example, 2929392499 + ... + 2929392864.
It is an arithmetic number, because the mean of its divisors is an integer number (181622346284).
Almost surely, 21072157721429 is an apocalyptic number.
It is an amenable number.
1072157721429 is a deficient number, since it is larger than the sum of its proper divisors (380821048843).
1072157721429 is an equidigital number, since it uses as much as digits as its factorization.
1072157721429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5858785427.
The product of its (nonzero) digits is 493920, while the sum is 48.
The spelling of 1072157721429 in words is "one trillion, seventy-two billion, one hundred fifty-seven million, seven hundred twenty-one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •