Base | Representation |
---|---|
bin | 10011001110010011101… |
… | …110001000010000111100 |
3 | 11200021211002012221212002 |
4 | 103032103232020100330 |
5 | 133120434011144400 |
6 | 2450512504201432 |
7 | 164304302542640 |
oct | 23162356102074 |
9 | 4607732187762 |
10 | 1321033303100 |
11 | 46a279951115 |
12 | 194037469278 |
13 | 9775a89c814 |
14 | 47d1cbaac20 |
15 | 2456a74eed5 |
hex | 13393b8843c |
1321033303100 has 72 divisors (see below), whose sum is σ = 3276963594240. Its totient is φ = 452814966720.
The previous prime is 1321033303097. The next prime is 1321033303207. The reversal of 1321033303100 is 13033301231.
It is a super-2 number, since 2×13210333031002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 2660261 + ... + 3117539.
Almost surely, 21321033303100 is an apocalyptic number.
1321033303100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1321033303100 is an abundant number, since it is smaller than the sum of its proper divisors (1955930291140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321033303100 is a wasteful number, since it uses less digits than its factorization.
1321033303100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461427 (or 461420 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1321033303100 its reverse (13033301231), we get a palindrome (1334066604331).
The spelling of 1321033303100 in words is "one trillion, three hundred twenty-one billion, thirty-three million, three hundred three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •