Base | Representation |
---|---|
bin | 1010100001001010111110… |
… | …11101011111000110100101 |
3 | 10000220012120111112002120110 |
4 | 11100211133131133012211 |
5 | 11012430220104012203 |
6 | 121105435302323233 |
7 | 4605041654634063 |
oct | 520453735370645 |
9 | 100805514462513 |
10 | 23130000454053 |
11 | 7408418292a99 |
12 | 27168ba429519 |
13 | cba1c3b1701c |
14 | 59d6d86db033 |
15 | 2a19e74ccd03 |
hex | 15095f75f1a5 |
23130000454053 has 8 divisors (see below), whose sum is σ = 30840151390816. Its totient is φ = 15419924910000.
The previous prime is 23130000454027. The next prime is 23130000454063. The reversal of 23130000454053 is 35045400003132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23130000454053 - 212 = 23130000449957 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 23130000454053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23130000454063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18128398 + ... + 19362303.
It is an arithmetic number, because the mean of its divisors is an integer number (3855018923852).
Almost surely, 223130000454053 is an apocalyptic number.
It is an amenable number.
23130000454053 is a deficient number, since it is larger than the sum of its proper divisors (7710150936763).
23130000454053 is a wasteful number, since it uses less digits than its factorization.
23130000454053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37696355.
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 23130000454053 its reverse (35045400003132), we get a palindrome (58175400457185).
The spelling of 23130000454053 in words is "twenty-three trillion, one hundred thirty billion, four hundred fifty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •