Base | Representation |
---|---|
bin | 1010100100011011110011… |
… | …11100110110000111100110 |
3 | 10001021220221212222221222000 |
4 | 11102031321330312013212 |
5 | 11021244322143011402 |
6 | 121233140233350130 |
7 | 4616121152422500 |
oct | 522157174660746 |
9 | 101256855887860 |
10 | 23242114032102 |
11 | 7450a1a4a5619 |
12 | 2734588b68346 |
13 | cc7950177114 |
14 | 5a4cd24a2d70 |
15 | 2a48a9e20c1c |
hex | 152379f361e6 |
23242114032102 has 96 divisors (see below), whose sum is σ = 60927876311040. Its totient is φ = 6547074322320.
The previous prime is 23242114032101. The next prime is 23242114032209. The reversal of 23242114032102 is 20123041124232.
23242114032102 is a `hidden beast` number, since 2 + 3 + 2 + 42 + 1 + 1 + 403 + 210 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23242114032101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 61670358 + ... + 62046089.
It is an arithmetic number, because the mean of its divisors is an integer number (634665378240).
Almost surely, 223242114032102 is an apocalyptic number.
23242114032102 is an abundant number, since it is smaller than the sum of its proper divisors (37685762278938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23242114032102 is a wasteful number, since it uses less digits than its factorization.
23242114032102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123716543 (or 123716530 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 23242114032102 its reverse (20123041124232), we get a palindrome (43365155156334).
The spelling of 23242114032102 in words is "twenty-three trillion, two hundred forty-two billion, one hundred fourteen million, thirty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •