Base | Representation |
---|---|
bin | 10111000110000100011111… |
… | …011001111101010010011111 |
3 | 111022122012121211221120212201 |
4 | 113012010133121331102133 |
5 | 101303124340332401224 |
6 | 1000005343422512331 |
7 | 30252231004552663 |
oct | 2706043731752237 |
9 | 438565554846781 |
10 | 101572208481439 |
11 | 2a400593784403 |
12 | b48545b1356a7 |
13 | 448a2ab3b7b37 |
14 | 1b1219a4dc8a3 |
15 | bb21d60bea44 |
hex | 5c611f67d49f |
101572208481439 has 4 divisors (see below), whose sum is σ = 101619917364960. Its totient is φ = 101524499597920.
The previous prime is 101572208481433. The next prime is 101572208481547. The reversal of 101572208481439 is 934184802275101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101572208481439 - 27 = 101572208481311 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 101572208481439.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101572208481433) 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, 23854438567 + ... + 23854442824.
It is an arithmetic number, because the mean of its divisors is an integer number (25404979341240).
Almost surely, 2101572208481439 is an apocalyptic number.
101572208481439 is a deficient number, since it is larger than the sum of its proper divisors (47708883521).
101572208481439 is an equidigital number, since it uses as much as digits as its factorization.
101572208481439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47708883520.
The product of its (nonzero) digits is 3870720, while the sum is 55.
The spelling of 101572208481439 in words is "one hundred one trillion, five hundred seventy-two billion, two hundred eight million, four hundred eighty-one thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •