Base | Representation |
---|---|
bin | 1010101010010110100001… |
… | …10110011100100010010001 |
3 | 10002000100202201002101220020 |
4 | 11111023100312130202101 |
5 | 11033112222432411103 |
6 | 121510403452534053 |
7 | 4636606514013354 |
oct | 525132066344221 |
9 | 102010681071806 |
10 | 23445435435153 |
11 | 751a17609a016 |
12 | 2767a70a81329 |
13 | 1010b83630534 |
14 | 5b0a9d73229b |
15 | 2a9d09c74753 |
hex | 1552d0d9c891 |
23445435435153 has 8 divisors (see below), whose sum is σ = 31260628637568. Its totient is φ = 15630266261424.
The previous prime is 23445435435131. The next prime is 23445435435217. The reversal of 23445435435153 is 35153453454432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23445435435153 - 221 = 23445433338001 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23445435435096 and 23445435435105.
It is not an unprimeable number, because it can be changed into a prime (23445435415153) 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, 3591726 + ... + 7732487.
It is an arithmetic number, because the mean of its divisors is an integer number (3907578579696).
Almost surely, 223445435435153 is an apocalyptic number.
It is an amenable number.
23445435435153 is a deficient number, since it is larger than the sum of its proper divisors (7815193202415).
23445435435153 is a wasteful number, since it uses less digits than its factorization.
23445435435153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12014343.
The product of its digits is 25920000, while the sum is 51.
Adding to 23445435435153 its reverse (35153453454432), we get a palindrome (58598888889585).
The spelling of 23445435435153 in words is "twenty-three trillion, four hundred forty-five billion, four hundred thirty-five million, four hundred thirty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •