Base | Representation |
---|---|
bin | 100001101100000… |
… | …1000111010101111 |
3 | 2220210001100021120 |
4 | 1003120020322233 |
5 | 4303340321310 |
6 | 304100232023 |
7 | 40004153031 |
oct | 10330107257 |
9 | 2823040246 |
10 | 1130401455 |
11 | 53009a387 |
12 | 27669b613 |
13 | 150266601 |
14 | aa1b3c51 |
15 | 6938db70 |
hex | 43608eaf |
1130401455 has 8 divisors (see below), whose sum is σ = 1808642352. Its totient is φ = 602880768.
The previous prime is 1130401403. The next prime is 1130401477. The reversal of 1130401455 is 5541040311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1130401455 - 220 = 1129352879 is a prime.
It is a super-3 number, since 3×11304014553 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37680034 + ... + 37680063.
It is an arithmetic number, because the mean of its divisors is an integer number (226080294).
Almost surely, 21130401455 is an apocalyptic number.
1130401455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1130401455 is a deficient number, since it is larger than the sum of its proper divisors (678240897).
1130401455 is an equidigital number, since it uses as much as digits as its factorization.
1130401455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75360105.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 1130401455 is about 33621.4433806760. The cubic root of 1130401455 is about 1041.7037700988.
Adding to 1130401455 its reverse (5541040311), we get a palindrome (6671441766).
The spelling of 1130401455 in words is "one billion, one hundred thirty million, four hundred one thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •