Base | Representation |
---|---|
bin | 11110010001100001100… |
… | …01001111111011110011 |
3 | 10200102221100101101010002 |
4 | 33020300301033323303 |
5 | 114020312234133243 |
6 | 2113510022300215 |
7 | 135103063453430 |
oct | 17106061177363 |
9 | 3612840341102 |
10 | 1040200302323 |
11 | 371167a53046 |
12 | 149720b8766b |
13 | 771239acb90 |
14 | 384bb474b87 |
15 | 1c0d0b16eb8 |
hex | f230c4fef3 |
1040200302323 has 32 divisors (see below), whose sum is σ = 1336405926912. Its totient is φ = 786939753600.
The previous prime is 1040200302319. The next prime is 1040200302331. The reversal of 1040200302323 is 3232030020401.
It is not a de Polignac number, because 1040200302323 - 22 = 1040200302319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1040200302295 and 1040200302304.
It is not an unprimeable number, because it can be changed into a prime (1040200302923) 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 31 ways as a sum of consecutive naturals, for example, 5624993 + ... + 5806973.
It is an arithmetic number, because the mean of its divisors is an integer number (41762685216).
Almost surely, 21040200302323 is an apocalyptic number.
1040200302323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1040200302323 is a deficient number, since it is larger than the sum of its proper divisors (296205624589).
1040200302323 is a wasteful number, since it uses less digits than its factorization.
1040200302323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184755.
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 1040200302323 its reverse (3232030020401), we get a palindrome (4272230322724).
The spelling of 1040200302323 in words is "one trillion, forty billion, two hundred million, three hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •