Base | Representation |
---|---|
bin | 10011110001011010… |
… | …100001101101000001 |
3 | 2000210120020110011102 |
4 | 103301122201231001 |
5 | 321434403211113 |
6 | 13430351224145 |
7 | 1351050100445 |
oct | 236132415501 |
9 | 60716213142 |
10 | 21230132033 |
11 | 9004946470 |
12 | 4145b18055 |
13 | 20044bc206 |
14 | 105581a825 |
15 | 843c59758 |
hex | 4f16a1b41 |
21230132033 has 4 divisors (see below), whose sum is σ = 23160144048. Its totient is φ = 19300120020.
The previous prime is 21230132029. The next prime is 21230132041. The reversal of 21230132033 is 33023103212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21230132033 - 22 = 21230132029 is a prime.
It is a super-2 number, since 2×212301320332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21230131996 and 21230132014.
It is not an unprimeable number, because it can be changed into a prime (21230132023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 965005991 + ... + 965006012.
It is an arithmetic number, because the mean of its divisors is an integer number (5790036012).
Almost surely, 221230132033 is an apocalyptic number.
It is an amenable number.
21230132033 is a deficient number, since it is larger than the sum of its proper divisors (1930012015).
21230132033 is a wasteful number, since it uses less digits than its factorization.
21230132033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1930012014.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 21230132033 its reverse (33023103212), we get a palindrome (54253235245).
The spelling of 21230132033 in words is "twenty-one billion, two hundred thirty million, one hundred thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •