Base | Representation |
---|---|
bin | 11101111110111110001… |
… | …10001100000011011001 |
3 | 10122111020012112221122001 |
4 | 32333133012030003121 |
5 | 113334412433001040 |
6 | 2105141421201001 |
7 | 134301211401130 |
oct | 16773706140331 |
9 | 3574205487561 |
10 | 1030240125145 |
11 | 367a16768560 |
12 | 147801400161 |
13 | 761c732670a |
14 | 37c1471a917 |
15 | 1bbeb4c359a |
hex | efdf18c0d9 |
1030240125145 has 16 divisors (see below), whose sum is σ = 1541346265728. Its totient is φ = 642227610240.
The previous prime is 1030240125143. The next prime is 1030240125149. The reversal of 1030240125145 is 5415210420301.
It is not a de Polignac number, because 1030240125145 - 21 = 1030240125143 is a prime.
It is a super-2 number, since 2×10302401251452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1030240125143) 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, 1337973804 + ... + 1337974573.
It is an arithmetic number, because the mean of its divisors is an integer number (96334141608).
Almost surely, 21030240125145 is an apocalyptic number.
It is an amenable number.
1030240125145 is a deficient number, since it is larger than the sum of its proper divisors (511106140583).
1030240125145 is a wasteful number, since it uses less digits than its factorization.
1030240125145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2675948400.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 1030240125145 its reverse (5415210420301), we get a palindrome (6445450545446).
The spelling of 1030240125145 in words is "one trillion, thirty billion, two hundred forty million, one hundred twenty-five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •