Base | Representation |
---|---|
bin | 1010101010100001011100… |
… | …11101111000010111100001 |
3 | 10002000220220111020001020011 |
4 | 11111100232131320113201 |
5 | 11033211231030134103 |
6 | 121513213504444521 |
7 | 4640205046455235 |
oct | 525205635702741 |
9 | 102026814201204 |
10 | 23451301021153 |
11 | 7521706063655 |
12 | 2769029319741 |
13 | 10115a98c6695 |
14 | 5b10987525c5 |
15 | 2aa04ebaad6d |
hex | 15542e7785e1 |
23451301021153 has 8 divisors (see below), whose sum is σ = 23518621526400. Its totient is φ = 23384016590448.
The previous prime is 23451301021123. The next prime is 23451301021279. The reversal of 23451301021153 is 35112010315432.
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 23451301021153 - 237 = 23313862067681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23451301021123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7716343 + ... + 10317196.
It is an arithmetic number, because the mean of its divisors is an integer number (2939827690800).
Almost surely, 223451301021153 is an apocalyptic number.
It is an amenable number.
23451301021153 is a deficient number, since it is larger than the sum of its proper divisors (67320505247).
23451301021153 is a wasteful number, since it uses less digits than its factorization.
23451301021153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18037271.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 23451301021153 its reverse (35112010315432), we get a palindrome (58563311336585).
The spelling of 23451301021153 in words is "twenty-three trillion, four hundred fifty-one billion, three hundred one million, twenty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •