Base | Representation |
---|---|
bin | 10001111001101101111… |
… | …100001100011111100111 |
3 | 11100121101010000100200000 |
4 | 101321231330030133213 |
5 | 130123430004034030 |
6 | 2341052021352343 |
7 | 154610426116332 |
oct | 21715574143747 |
9 | 4317333010600 |
10 | 1230205143015 |
11 | 4347aa806102 |
12 | 17a5092686b3 |
13 | 8c014317cb4 |
14 | 43783cd3619 |
15 | 22001837860 |
hex | 11e6df0c7e7 |
1230205143015 has 48 divisors (see below), whose sum is σ = 2211639026688. Its totient is φ = 656018230176.
The previous prime is 1230205142917. The next prime is 1230205143023. The reversal of 1230205143015 is 5103415020321.
1230205143015 is a `hidden beast` number, since 1 + 2 + 302 + 0 + 51 + 4 + 301 + 5 = 666.
It is not a de Polignac number, because 1230205143015 - 28 = 1230205142759 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 1230205143015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9175954 + ... + 9309056.
It is an arithmetic number, because the mean of its divisors is an integer number (46075813056).
Almost surely, 21230205143015 is an apocalyptic number.
1230205143015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1230205143015 is a deficient number, since it is larger than the sum of its proper divisors (981433883673).
1230205143015 is an equidigital number, since it uses as much as digits as its factorization.
1230205143015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140730 (or 140718 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The spelling of 1230205143015 in words is "one trillion, two hundred thirty billion, two hundred five million, one hundred forty-three thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •