Base | Representation |
---|---|
bin | 11110000010101000001… |
… | …11000110110111101011 |
3 | 10122200022000121120201010 |
4 | 33001110013012313223 |
5 | 113402423021102311 |
6 | 2110104310555003 |
7 | 134400650201010 |
oct | 17012407066753 |
9 | 3580260546633 |
10 | 1032203300331 |
11 | 368833943095 |
12 | 14806a968a63 |
13 | 7644ac79538 |
14 | 37d5d34b707 |
15 | 1bcb3a0eda6 |
hex | f0541c6deb |
1032203300331 has 16 divisors (see below), whose sum is σ = 1573900634624. Its totient is φ = 589448176704.
The previous prime is 1032203300321. The next prime is 1032203300347. The reversal of 1032203300331 is 1330033022301.
It is not a de Polignac number, because 1032203300331 - 27 = 1032203300203 is a prime.
It is a super-2 number, since 2×10322033003312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1032203300298 and 1032203300307.
It is not an unprimeable number, because it can be changed into a prime (1032203300321) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15895186 + ... + 15959991.
It is an arithmetic number, because the mean of its divisors is an integer number (98368789664).
Almost surely, 21032203300331 is an apocalyptic number.
1032203300331 is a deficient number, since it is larger than the sum of its proper divisors (541697334293).
1032203300331 is a wasteful number, since it uses less digits than its factorization.
1032203300331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31856730.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 1032203300331 its reverse (1330033022301), we get a palindrome (2362236322632).
The spelling of 1032203300331 in words is "one trillion, thirty-two billion, two hundred three million, three hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •