Base | Representation |
---|---|
bin | 11101111110110001010… |
… | …01101111000110100001 |
3 | 10122110221200002210020210 |
4 | 32333120221233012201 |
5 | 113334202243100413 |
6 | 2105122555524333 |
7 | 134265426360654 |
oct | 16773051570641 |
9 | 3573850083223 |
10 | 1030132003233 |
11 | 367970729a03 |
12 | 1477911596a9 |
13 | 761aaacb158 |
14 | 37c0421389b |
15 | 1bbe1c673c3 |
hex | efd8a6f1a1 |
1030132003233 has 8 divisors (see below), whose sum is σ = 1376514830368. Its totient is φ = 685251922464.
The previous prime is 1030132003231. The next prime is 1030132003249. The reversal of 1030132003233 is 3323002310301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1030132003233 - 21 = 1030132003231 is a prime.
It is a super-2 number, since 2×10301320032332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030132003231) 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 in 7 ways as a sum of consecutive naturals, for example, 375684991 + ... + 375687732.
It is an arithmetic number, because the mean of its divisors is an integer number (172064353796).
Almost surely, 21030132003233 is an apocalyptic number.
It is an amenable number.
1030132003233 is a deficient number, since it is larger than the sum of its proper divisors (346382827135).
1030132003233 is an equidigital number, since it uses as much as digits as its factorization.
1030132003233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 751373183.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 1030132003233 its reverse (3323002310301), we get a palindrome (4353134313534).
The spelling of 1030132003233 in words is "one trillion, thirty billion, one hundred thirty-two million, three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •