Base | Representation |
---|---|
bin | 110100100110010010111110… |
… | …011010001100101000111000 |
3 | 1010100001221111201102102001121 |
4 | 310212102332122030220320 |
5 | 220310103103033213422 |
6 | 2135555332425155024 |
7 | 66504023230562233 |
oct | 6446227632145070 |
9 | 1110057451372047 |
10 | 231330133101112 |
11 | 6778861640a441 |
12 | 21b413b562ba74 |
13 | 9c104516207b6 |
14 | 411a61c53041a |
15 | 1bb26634098c7 |
hex | d264be68ca38 |
231330133101112 has 8 divisors (see below), whose sum is σ = 433743999564600. Its totient is φ = 115665066550552.
The previous prime is 231330133101091. The next prime is 231330133101113. The reversal of 231330133101112 is 211101331033132.
It is a tau number, because it is divible by the number of its divisors (8).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231330133101113) 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 as a sum of consecutive naturals, namely, 14458133318812 + ... + 14458133318827.
It is an arithmetic number, because the mean of its divisors is an integer number (54217999945575).
Almost surely, 2231330133101112 is an apocalyptic number.
It is an amenable number.
231330133101112 is a deficient number, since it is larger than the sum of its proper divisors (202413866463488).
231330133101112 is a wasteful number, since it uses less digits than its factorization.
231330133101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28916266637645 (or 28916266637641 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 231330133101112 its reverse (211101331033132), we get a palindrome (442431464134244).
The spelling of 231330133101112 in words is "two hundred thirty-one trillion, three hundred thirty billion, one hundred thirty-three million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •