Base | Representation |
---|---|
bin | 1001001101110100110010… |
… | …0111101011001100100111 |
3 | 1022212201100002102112220220 |
4 | 2103131030213223030213 |
5 | 2312010104002221411 |
6 | 33315031001255423 |
7 | 2064043665035106 |
oct | 223351447531447 |
9 | 38781302375826 |
10 | 10133113320231 |
11 | 325747a332780 |
12 | 1177a47194573 |
13 | 58671903cc75 |
14 | 270633c9c03d |
15 | 1288bb281b06 |
hex | 9374c9eb327 |
10133113320231 has 32 divisors (see below), whose sum is σ = 14855351132160. Its totient is φ = 6092892924000.
The previous prime is 10133113320139. The next prime is 10133113320299. The reversal of 10133113320231 is 13202331133101.
It is not a de Polignac number, because 10133113320231 - 210 = 10133113319207 is a prime.
It is a super-2 number, since 2×101331133202312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10133113320431) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5894506 + ... + 7416968.
It is an arithmetic number, because the mean of its divisors is an integer number (464229722880).
Almost surely, 210133113320231 is an apocalyptic number.
10133113320231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10133113320231 is a deficient number, since it is larger than the sum of its proper divisors (4722237811929).
10133113320231 is a wasteful number, since it uses less digits than its factorization.
10133113320231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1524067.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 10133113320231 its reverse (13202331133101), we get a palindrome (23335444453332).
The spelling of 10133113320231 in words is "ten trillion, one hundred thirty-three billion, one hundred thirteen million, three hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •