Base | Representation |
---|---|
bin | 1010100011111010010111… |
… | …11111111100111000101011 |
3 | 10001020012121212101111002101 |
4 | 11101331023333330320223 |
5 | 11021001041241201011 |
6 | 121221011105314231 |
7 | 4614614262164341 |
oct | 521751377747053 |
9 | 101205555344071 |
10 | 23224163225131 |
11 | 7444348762660 |
12 | 2730bb9335977 |
13 | cc604c1ab84b |
14 | 5a40ac3dd991 |
15 | 2a41a90332c1 |
hex | 151f4bffce2b |
23224163225131 has 16 divisors (see below), whose sum is σ = 25954073859168. Its totient is φ = 20597383628800.
The previous prime is 23224163225113. The next prime is 23224163225141. The reversal of 23224163225131 is 13152236142232.
It is not a de Polignac number, because 23224163225131 - 25 = 23224163225099 is a prime.
It is a super-2 number, since 2×232241632251312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23224163225101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16925535 + ... + 18246151.
It is an arithmetic number, because the mean of its divisors is an integer number (1622129616198).
Almost surely, 223224163225131 is an apocalyptic number.
23224163225131 is a deficient number, since it is larger than the sum of its proper divisors (2729910634037).
23224163225131 is a wasteful number, since it uses less digits than its factorization.
23224163225131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1359662.
The product of its digits is 103680, while the sum is 37.
Adding to 23224163225131 its reverse (13152236142232), we get a palindrome (36376399367363).
The spelling of 23224163225131 in words is "twenty-three trillion, two hundred twenty-four billion, one hundred sixty-three million, two hundred twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •