Base | Representation |
---|---|
bin | 10001111001100011100… |
… | …010100110011101111101 |
3 | 11100120220221200210000201 |
4 | 101321203202212131331 |
5 | 130123100322132001 |
6 | 2341022425523501 |
7 | 154603210054015 |
oct | 21714342463575 |
9 | 4316827623021 |
10 | 1230030661501 |
11 | 434720272604 |
12 | 17a47a943591 |
13 | 8bcb7126bb5 |
14 | 43768a74c45 |
15 | 21ee136e501 |
hex | 11e638a677d |
1230030661501 has 16 divisors (see below), whose sum is σ = 1245142886400. Its totient is φ = 1214978128000.
The previous prime is 1230030661499. The next prime is 1230030661507. The reversal of 1230030661501 is 1051660300321.
It is a cyclic number.
It is not a de Polignac number, because 1230030661501 - 21 = 1230030661499 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1230030661501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1230030661507) 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 15 ways as a sum of consecutive naturals, for example, 176750460 + ... + 176757418.
It is an arithmetic number, because the mean of its divisors is an integer number (77821430400).
Almost surely, 21230030661501 is an apocalyptic number.
It is an amenable number.
1230030661501 is a deficient number, since it is larger than the sum of its proper divisors (15112224899).
1230030661501 is a wasteful number, since it uses less digits than its factorization.
1230030661501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10940.
The product of its (nonzero) digits is 3240, while the sum is 28.
Adding to 1230030661501 its reverse (1051660300321), we get a palindrome (2281690961822).
The spelling of 1230030661501 in words is "one trillion, two hundred thirty billion, thirty million, six hundred sixty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •