Base | Representation |
---|---|
bin | 11101111110110001011… |
… | …01100010110001101010 |
3 | 10122110221201222111101001 |
4 | 32333120231202301222 |
5 | 113334203022020242 |
6 | 2105123033145214 |
7 | 134265441015565 |
oct | 16773055426152 |
9 | 3573851874331 |
10 | 1030133001322 |
11 | 367971250877 |
12 | 14779155b20a |
13 | 761ab08a539 |
14 | 37c043d34dc |
15 | 1bbe1db2eb7 |
hex | efd8b62c6a |
1030133001322 has 8 divisors (see below), whose sum is σ = 1545344609472. Its totient is φ = 515018131500.
The previous prime is 1030133001229. The next prime is 1030133001329. The reversal of 1030133001322 is 2231003310301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10301330013222 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1030133001322.
It is not an unprimeable number, because it can be changed into a prime (1030133001329) 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 3 ways as a sum of consecutive naturals, for example, 24157954 + ... + 24200557.
It is an arithmetic number, because the mean of its divisors is an integer number (193168076184).
Almost surely, 21030133001322 is an apocalyptic number.
1030133001322 is a deficient number, since it is larger than the sum of its proper divisors (515211608150).
1030133001322 is a wasteful number, since it uses less digits than its factorization.
1030133001322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48369164.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 1030133001322 its reverse (2231003310301), we get a palindrome (3261136311623).
The spelling of 1030133001322 in words is "one trillion, thirty billion, one hundred thirty-three million, one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •