Base | Representation |
---|---|
bin | 11101111110111110010… |
… | …01111101010111000110 |
3 | 10122111020021102011110100 |
4 | 32333133021331113012 |
5 | 113334413211113132 |
6 | 2105141454304530 |
7 | 134301222655554 |
oct | 16773711752706 |
9 | 3574207364410 |
10 | 1030241113542 |
11 | 367a17283113 |
12 | 1478017b8146 |
13 | 761c75b1574 |
14 | 37c148d6bd4 |
15 | 1bbeb61b37c |
hex | efdf27d5c6 |
1030241113542 has 12 divisors (see below), whose sum is σ = 2232189079380. Its totient is φ = 343413704508.
The previous prime is 1030241113541. The next prime is 1030241113547. The reversal of 1030241113542 is 2453111420301.
1030241113542 is a `hidden beast` number, since 1 + 0 + 3 + 0 + 2 + 4 + 1 + 113 + 542 = 666.
It is a super-2 number, since 2×10302411135422 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030241113541) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 28617808692 + ... + 28617808727.
It is an arithmetic number, because the mean of its divisors is an integer number (186015756615).
Almost surely, 21030241113542 is an apocalyptic number.
1030241113542 is an abundant number, since it is smaller than the sum of its proper divisors (1201947965838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030241113542 is a wasteful number, since it uses less digits than its factorization.
1030241113542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57235617427 (or 57235617424 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 1030241113542 its reverse (2453111420301), we get a palindrome (3483352533843).
The spelling of 1030241113542 in words is "one trillion, thirty billion, two hundred forty-one million, one hundred thirteen thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •