Base | Representation |
---|---|
bin | 101000000110110… |
… | …1011011101001100 |
3 | 10110210021211222120 |
4 | 1100031223131030 |
5 | 10224003410043 |
6 | 341312212540 |
7 | 45230540502 |
oct | 12015533514 |
9 | 3423254876 |
10 | 1345763148 |
11 | 630714854 |
12 | 31683a150 |
13 | 185a6ba72 |
14 | caa34672 |
15 | 7d22e983 |
hex | 5036b74c |
1345763148 has 12 divisors (see below), whose sum is σ = 3140114040. Its totient is φ = 448587712.
The previous prime is 1345763147. The next prime is 1345763191. The reversal of 1345763148 is 8413675431.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×13457631482 = 3622156901029739808, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (1345763147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56073453 + ... + 56073476.
It is an arithmetic number, because the mean of its divisors is an integer number (261676170).
Almost surely, 21345763148 is an apocalyptic number.
It is an amenable number.
1345763148 is an abundant number, since it is smaller than the sum of its proper divisors (1794350892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1345763148 is a wasteful number, since it uses less digits than its factorization.
1345763148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112146936 (or 112146934 counting only the distinct ones).
The product of its digits is 241920, while the sum is 42.
The square root of 1345763148 is about 36684.6445805326. The cubic root of 1345763148 is about 1104.0520382161.
The spelling of 1345763148 in words is "one billion, three hundred forty-five million, seven hundred sixty-three thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •