Base | Representation |
---|---|
bin | 11101111110110000010… |
… | …00010011111111000101 |
3 | 10122110221001121122021221 |
4 | 32333120020103333011 |
5 | 113334143022211123 |
6 | 2105122044040341 |
7 | 134265262036210 |
oct | 16773010237705 |
9 | 3573831548257 |
10 | 1030123241413 |
11 | 367966795032 |
12 | 14778a2330b1 |
13 | 761a9051046 |
14 | 37c02db2777 |
15 | 1bbe10d625d |
hex | efd8213fc5 |
1030123241413 has 16 divisors (see below), whose sum is σ = 1246565479680. Its totient is φ = 831003929856.
The previous prime is 1030123241383. The next prime is 1030123241429. The reversal of 1030123241413 is 3141423210301.
It is a cyclic number.
It is not a de Polignac number, because 1030123241413 - 225 = 1030089686981 is a prime.
It is a super-2 number, since 2×10301232414132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030123241443) 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, 6854920 + ... + 7003582.
It is an arithmetic number, because the mean of its divisors is an integer number (77910342480).
Almost surely, 21030123241413 is an apocalyptic number.
It is an amenable number.
1030123241413 is a deficient number, since it is larger than the sum of its proper divisors (216442238267).
1030123241413 is a wasteful number, since it uses less digits than its factorization.
1030123241413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206916.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1030123241413 its reverse (3141423210301), we get a palindrome (4171546451714).
The spelling of 1030123241413 in words is "one trillion, thirty billion, one hundred twenty-three million, two hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •