Base | Representation |
---|---|
bin | 1001010000000111110001… |
… | …00100011000010011010111 |
3 | 2200000222100110121102112221 |
4 | 10220003320210120103113 |
5 | 10131313314130301101 |
6 | 111134232015323211 |
7 | 4166613264354202 |
oct | 450037044302327 |
9 | 80028313542487 |
10 | 20345135400151 |
11 | 653436159a531 |
12 | 2347034820507 |
13 | b476cc0b01c3 |
14 | 5049d19d6939 |
15 | 254354ccbaa1 |
hex | 1280f89184d7 |
20345135400151 has 8 divisors (see below), whose sum is σ = 20351810304000. Its totient is φ = 20338461093720.
The previous prime is 20345135400101. The next prime is 20345135400157. The reversal of 20345135400151 is 15100453154302.
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 20345135400151 - 235 = 20310775661783 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20345135400157) 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, 73931430 + ... + 74206108.
It is an arithmetic number, because the mean of its divisors is an integer number (2543976288000).
Almost surely, 220345135400151 is an apocalyptic number.
20345135400151 is a deficient number, since it is larger than the sum of its proper divisors (6674903849).
20345135400151 is a wasteful number, since it uses less digits than its factorization.
20345135400151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298709.
The product of its (nonzero) digits is 36000, while the sum is 34.
Adding to 20345135400151 its reverse (15100453154302), we get a palindrome (35445588554453).
The spelling of 20345135400151 in words is "twenty trillion, three hundred forty-five billion, one hundred thirty-five million, four hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •