Base | Representation |
---|---|
bin | 100100101010011… |
… | …0101110010011101 |
3 | 10011201211122002200 |
4 | 1021110311302131 |
5 | 10004412344330 |
6 | 322023242113 |
7 | 42325345551 |
oct | 11124656235 |
9 | 3151748080 |
10 | 1230199965 |
11 | 581463495 |
12 | 2a3ba9339 |
13 | 167b39497 |
14 | b9551861 |
15 | 73003a60 |
hex | 49535c9d |
1230199965 has 48 divisors (see below), whose sum is σ = 2232292608. Its totient is φ = 625540608.
The previous prime is 1230199963. The next prime is 1230200017. The reversal of 1230199965 is 5699910321.
It is a happy number.
It is not a de Polignac number, because 1230199965 - 21 = 1230199963 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 1230199965.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230199963) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 347032 + ... + 350558.
It is an arithmetic number, because the mean of its divisors is an integer number (46506096).
Almost surely, 21230199965 is an apocalyptic number.
1230199965 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1230199965 is a deficient number, since it is larger than the sum of its proper divisors (1002092643).
1230199965 is a wasteful number, since it uses less digits than its factorization.
1230199965 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3898 (or 3895 counting only the distinct ones).
The product of its (nonzero) digits is 131220, while the sum is 45.
The square root of 1230199965 is about 35074.2065484025. The cubic root of 1230199965 is about 1071.4993290794.
The spelling of 1230199965 in words is "one billion, two hundred thirty million, one hundred ninety-nine thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •