Base | Representation |
---|---|
bin | 10010111100101011111… |
… | …111110100010100010111 |
3 | 11121110222111210012000000 |
4 | 102330223333310110113 |
5 | 132313211442142333 |
6 | 2434103233422343 |
7 | 163034402632056 |
oct | 22745377642427 |
9 | 4543874705000 |
10 | 1302113240343 |
11 | 46224aa83a13 |
12 | 19043710a9b3 |
13 | 95a33b6ca06 |
14 | 470460c039d |
15 | 23d0e705713 |
hex | 12f2bff4517 |
1302113240343 has 56 divisors (see below), whose sum is σ = 2016126149856. Its totient is φ = 839944468800.
The previous prime is 1302113240227. The next prime is 1302113240369. The reversal of 1302113240343 is 3430423112031.
It is a happy number.
1302113240343 is a `hidden beast` number, since 1 + 3 + 0 + 211 + 3 + 2 + 403 + 43 = 666.
It is not a de Polignac number, because 1302113240343 - 224 = 1302096463127 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302113240843) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 4748758 + ... + 5015468.
It is an arithmetic number, because the mean of its divisors is an integer number (36002252676).
Almost surely, 21302113240343 is an apocalyptic number.
1302113240343 is a deficient number, since it is larger than the sum of its proper divisors (714012909513).
1302113240343 is an equidigital number, since it uses as much as digits as its factorization.
1302113240343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266947 (or 266932 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1302113240343 its reverse (3430423112031), we get a palindrome (4732536352374).
The spelling of 1302113240343 in words is "one trillion, three hundred two billion, one hundred thirteen million, two hundred forty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •