Base | Representation |
---|---|
bin | 1010100011111000100111… |
… | …10101110001111000100111 |
3 | 10001020010012012111020120101 |
4 | 11101330103311301320213 |
5 | 11020442124041101120 |
6 | 121220333411044531 |
7 | 4614552031535104 |
oct | 521742365617047 |
9 | 101203165436511 |
10 | 23223221034535 |
11 | 7443a04933945 |
12 | 27309958a0747 |
13 | cc5c2bc32512 |
14 | 5a401d21daab |
15 | 2a415147090a |
hex | 151f13d71e27 |
23223221034535 has 8 divisors (see below), whose sum is σ = 28621050788736. Its totient is φ = 18076453129440.
The previous prime is 23223221034509. The next prime is 23223221034551. The reversal of 23223221034535 is 53543012232232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23223221034535 - 215 = 23223221001767 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23223221034494 and 23223221034503.
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, 62765462071 + ... + 62765462440.
It is an arithmetic number, because the mean of its divisors is an integer number (3577631348592).
Almost surely, 223223221034535 is an apocalyptic number.
23223221034535 is a deficient number, since it is larger than the sum of its proper divisors (5397829754201).
23223221034535 is a wasteful number, since it uses less digits than its factorization.
23223221034535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125530924553.
The product of its (nonzero) digits is 259200, while the sum is 37.
Adding to 23223221034535 its reverse (53543012232232), we get a palindrome (76766233266767).
The spelling of 23223221034535 in words is "twenty-three trillion, two hundred twenty-three billion, two hundred twenty-one million, thirty-four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •