Base | Representation |
---|---|
bin | 11110000100011111000… |
… | …01010010111000100110 |
3 | 10122202212111010020110120 |
4 | 33002033201102320212 |
5 | 113411443201133110 |
6 | 2110351234102410 |
7 | 134434442163162 |
oct | 17021741227046 |
9 | 3582774106416 |
10 | 1033200021030 |
11 | 3691a5527101 |
12 | 1482a871aa06 |
13 | 76579608bb8 |
14 | 38015883ca2 |
15 | 1bd21294870 |
hex | f08f852e26 |
1033200021030 has 16 divisors (see below), whose sum is σ = 2479680050544. Its totient is φ = 275520005600.
The previous prime is 1033200021019. The next prime is 1033200021031. The reversal of 1033200021030 is 301200023301.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1033200021031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17220000321 + ... + 17220000380.
It is an arithmetic number, because the mean of its divisors is an integer number (154980003159).
Almost surely, 21033200021030 is an apocalyptic number.
1033200021030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1033200021030 is an abundant number, since it is smaller than the sum of its proper divisors (1446480029514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033200021030 is a wasteful number, since it uses less digits than its factorization.
1033200021030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34440000711.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 1033200021030 its reverse (301200023301), we get a palindrome (1334400044331).
The spelling of 1033200021030 in words is "one trillion, thirty-three billion, two hundred million, twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •