Base | Representation |
---|---|
bin | 1001001101110100011100… |
… | …0111100111011101000101 |
3 | 1022212201002122202201211002 |
4 | 2103131013013213131011 |
5 | 2312004411340431323 |
6 | 33315013503223045 |
7 | 2064041464424024 |
oct | 223350707473505 |
9 | 38781078681732 |
10 | 10133021030213 |
11 | 3257432227934 |
12 | 1177a202a7a85 |
13 | 586702b988a3 |
14 | 2706259168bb |
15 | 1288b3101828 |
hex | 937471e7745 |
10133021030213 has 12 divisors (see below), whose sum is σ = 10983445284780. Its totient is φ = 9340252658496.
The previous prime is 10133021030203. The next prime is 10133021030261. The reversal of 10133021030213 is 31203012033101.
It can be written as a sum of positive squares in 2 ways, for example, as 6902510871169 + 3230510159044 = 2627263^2 + 1797362^2 .
It is a de Polignac number, because none of the positive numbers 2k-10133021030213 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10133021030203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 379301648 + ... + 379328361.
It is an arithmetic number, because the mean of its divisors is an integer number (915287107065).
Almost surely, 210133021030213 is an apocalyptic number.
It is an amenable number.
10133021030213 is a deficient number, since it is larger than the sum of its proper divisors (850424254567).
10133021030213 is an equidigital number, since it uses as much as digits as its factorization.
10133021030213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 758630084 (or 758630065 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10133021030213 its reverse (31203012033101), we get a palindrome (41336033063314).
The spelling of 10133021030213 in words is "ten trillion, one hundred thirty-three billion, twenty-one million, thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •