Base | Representation |
---|---|
bin | 10111001110001110110001… |
… | …111101011110001011101111 |
3 | 111101121211011021121120000020 |
4 | 113032032301331132023233 |
5 | 101341321402312410411 |
6 | 1001115131454133223 |
7 | 30340603162456644 |
oct | 2716166175361357 |
9 | 441554137546006 |
10 | 102133013013231 |
11 | 2a5a7405275572 |
12 | b55608b4b1213 |
13 | 44cb1428715b5 |
14 | 1b3139ad9ddcb |
15 | bc1aa9dc5606 |
hex | 5ce3b1f5e2ef |
102133013013231 has 8 divisors (see below), whose sum is σ = 140873121397680. Its totient is φ = 65740789985472.
The previous prime is 102133013013223. The next prime is 102133013013271. The reversal of 102133013013231 is 132310310331201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102133013013231 - 23 = 102133013013223 is a prime.
It is a super-2 number, since 2×1021330130132312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102133013013211) 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, 586971339070 + ... + 586971339243.
It is an arithmetic number, because the mean of its divisors is an integer number (17609140174710).
Almost surely, 2102133013013231 is an apocalyptic number.
102133013013231 is a deficient number, since it is larger than the sum of its proper divisors (38740108384449).
102133013013231 is a wasteful number, since it uses less digits than its factorization.
102133013013231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1173942678345.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 102133013013231 its reverse (132310310331201), we get a palindrome (234443323344432).
The spelling of 102133013013231 in words is "one hundred two trillion, one hundred thirty-three billion, thirteen million, thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •