Base | Representation |
---|---|
bin | 1010011110110110011000… |
… | …10000100101101011100000 |
3 | 10000121120122120011210120121 |
4 | 11033123030100211223200 |
5 | 11010123323140123130 |
6 | 121005043040450024 |
7 | 4566215655152665 |
oct | 517331420455340 |
9 | 100546576153517 |
10 | 23050221411040 |
11 | 73875a908319a |
12 | 2703354619914 |
13 | cb281b6c63b5 |
14 | 5998cb03ba6c |
15 | 29e8c8607d7a |
hex | 14f6cc425ae0 |
23050221411040 has 48 divisors (see below), whose sum is σ = 57659450918832. Its totient is φ = 8677730412544.
The previous prime is 23050221410959. The next prime is 23050221411131. The reversal of 23050221411040 is 4011412205032.
It is a junction number, because it is equal to n+sod(n) for n = 23050221410996 and 23050221411014.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4237170334 + ... + 4237175773.
It is an arithmetic number, because the mean of its divisors is an integer number (1201238560809).
Almost surely, 223050221411040 is an apocalyptic number.
23050221411040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23050221411040 is an abundant number, since it is smaller than the sum of its proper divisors (34609229507792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23050221411040 is a wasteful number, since it uses less digits than its factorization.
23050221411040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8474346139 (or 8474346131 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 23050221411040 its reverse (4011412205032), we get a palindrome (27061633616072).
The spelling of 23050221411040 in words is "twenty-three trillion, fifty billion, two hundred twenty-one million, four hundred eleven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •