Base | Representation |
---|---|
bin | 1010011110000110010110… |
… | …01010010111111110010011 |
3 | 10000112010002100002222220211 |
4 | 11033003023022113332103 |
5 | 11004213014344413133 |
6 | 120545140101544551 |
7 | 4564313630041201 |
oct | 517031312277623 |
9 | 100463070088824 |
10 | 23024433201043 |
11 | 737767532934a |
12 | 26ba358115157 |
13 | cb026baa7541 |
14 | 598562118071 |
15 | 29ddb963bbcd |
hex | 14f0cb297f93 |
23024433201043 has 8 divisors (see below), whose sum is σ = 23528154931200. Its totient is φ = 22521288144840.
The previous prime is 23024433200959. The next prime is 23024433201151. The reversal of 23024433201043 is 34010233442032.
It is a happy number.
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 23024433201043 - 213 = 23024433192851 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23024433200996 and 23024433201014.
It is not an unprimeable number, because it can be changed into a prime (23024433201743) 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, 144087763 + ... + 144247468.
It is an arithmetic number, because the mean of its divisors is an integer number (2941019366400).
Almost surely, 223024433201043 is an apocalyptic number.
23024433201043 is a deficient number, since it is larger than the sum of its proper divisors (503721730157).
23024433201043 is a wasteful number, since it uses less digits than its factorization.
23024433201043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288336977.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 23024433201043 its reverse (34010233442032), we get a palindrome (57034666643075).
The spelling of 23024433201043 in words is "twenty-three trillion, twenty-four billion, four hundred thirty-three million, two hundred one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •