Base | Representation |
---|---|
bin | 1001001100110010100111… |
… | …01100011010101010100111 |
3 | 2122122000222021102201000110 |
4 | 10212121103230122222213 |
5 | 10122424433212213042 |
6 | 111005504430144103 |
7 | 4155422415453066 |
oct | 446312354325247 |
9 | 78560867381013 |
10 | 20230700116647 |
11 | 649a878891269 |
12 | 2328a18652033 |
13 | b39992a484b7 |
14 | 4dd2577521dd |
15 | 2513a862b09c |
hex | 126653b1aaa7 |
20230700116647 has 8 divisors (see below), whose sum is σ = 26975418825456. Its totient is φ = 13486557409472.
The previous prime is 20230700116643. The next prime is 20230700116699. The reversal of 20230700116647 is 74661100703202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20230700116647 - 22 = 20230700116643 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20230700116643) 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 7 ways as a sum of consecutive naturals, for example, 143918448 + ... + 144058949.
It is an arithmetic number, because the mean of its divisors is an integer number (3371927353182).
Almost surely, 220230700116647 is an apocalyptic number.
20230700116647 is a deficient number, since it is larger than the sum of its proper divisors (6744718708809).
20230700116647 is a wasteful number, since it uses less digits than its factorization.
20230700116647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288000817.
The product of its (nonzero) digits is 84672, while the sum is 39.
Adding to 20230700116647 its reverse (74661100703202), we get a palindrome (94891800819849).
The spelling of 20230700116647 in words is "twenty trillion, two hundred thirty billion, seven hundred million, one hundred sixteen thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •