Base | Representation |
---|---|
bin | 1010100001010001001100… |
… | …00000000111100011111000 |
3 | 10000220112011122022202210122 |
4 | 11100220212000013203320 |
5 | 11013004030320441212 |
6 | 121111150012432412 |
7 | 4605220342454201 |
oct | 520504600074370 |
9 | 100815148282718 |
10 | 23133331421432 |
11 | 74098775590a1 |
12 | 2717489a78708 |
13 | cba604c4c73b |
14 | 59d932c585a8 |
15 | 2a1b3eb4b272 |
hex | 150a260078f8 |
23133331421432 has 8 divisors (see below), whose sum is σ = 43374996415200. Its totient is φ = 11566665710712.
The previous prime is 23133331421419. The next prime is 23133331421441. The reversal of 23133331421432 is 23412413333132.
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 23133331421392 and 23133331421401.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1445833213832 + ... + 1445833213847.
It is an arithmetic number, because the mean of its divisors is an integer number (5421874551900).
Almost surely, 223133331421432 is an apocalyptic number.
It is an amenable number.
23133331421432 is a deficient number, since it is larger than the sum of its proper divisors (20241664993768).
23133331421432 is a wasteful number, since it uses less digits than its factorization.
23133331421432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2891666427685 (or 2891666427681 counting only the distinct ones).
The product of its digits is 93312, while the sum is 35.
Adding to 23133331421432 its reverse (23412413333132), we get a palindrome (46545744754564).
The spelling of 23133331421432 in words is "twenty-three trillion, one hundred thirty-three billion, three hundred thirty-one million, four hundred twenty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •