Base | Representation |
---|---|
bin | 10100110100101000001… |
… | …100101000010100011001 |
3 | 12001210101202222200121002 |
4 | 110310220030220110121 |
5 | 141420440004242311 |
6 | 3013202400554345 |
7 | 205243666434626 |
oct | 24645014502431 |
9 | 5053352880532 |
10 | 1430898509081 |
11 | 5019279a5508 |
12 | 1b13990229b5 |
13 | a4c19192b42 |
14 | 4d38210334d |
15 | 2734aabd93b |
hex | 14d28328519 |
1430898509081 has 4 divisors (see below), whose sum is σ = 1457896594212. Its totient is φ = 1403900423952.
The previous prime is 1430898509069. The next prime is 1430898509083. The reversal of 1430898509081 is 1809058980341.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 593078653456 + 837819855625 = 770116^2 + 915325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1430898509081 is a prime.
It is a super-2 number, since 2×14308985090812 (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 (1430898509083) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13499042486 + ... + 13499042591.
It is an arithmetic number, because the mean of its divisors is an integer number (364474148553).
Almost surely, 21430898509081 is an apocalyptic number.
It is an amenable number.
1430898509081 is a deficient number, since it is larger than the sum of its proper divisors (26998085131).
1430898509081 is an equidigital number, since it uses as much as digits as its factorization.
1430898509081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26998085130.
The product of its (nonzero) digits is 2488320, while the sum is 56.
The spelling of 1430898509081 in words is "one trillion, four hundred thirty billion, eight hundred ninety-eight million, five hundred nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •