Base | Representation |
---|---|
bin | 110101000110010111… |
… | …0011000110111101111 |
3 | 101220022221210022021202 |
4 | 1222030232120313233 |
5 | 3332013202323211 |
6 | 124215033120115 |
7 | 11144526013463 |
oct | 1521456306757 |
9 | 356287708252 |
10 | 114030120431 |
11 | 443a6037257 |
12 | 1a12455903b |
13 | a9a3436356 |
14 | 573a5384a3 |
15 | 2e75d1c53b |
hex | 1a8cb98def |
114030120431 has 8 divisors (see below), whose sum is σ = 120896445024. Its totient is φ = 107181425920.
The previous prime is 114030120401. The next prime is 114030120461. The reversal of 114030120431 is 134021030411.
It is an interprime number because it is at equal distance from previous prime (114030120401) and next prime (114030120461).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114030120431 - 214 = 114030104047 is a prime.
It is a super-2 number, since 2×1140301204312 (a number of 23 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 (114030120401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4394195 + ... + 4420068.
It is an arithmetic number, because the mean of its divisors is an integer number (15112055628).
Almost surely, 2114030120431 is an apocalyptic number.
114030120431 is a deficient number, since it is larger than the sum of its proper divisors (6866324593).
114030120431 is an equidigital number, since it uses as much as digits as its factorization.
114030120431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8815041.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 114030120431 its reverse (134021030411), we get a palindrome (248051150842).
The spelling of 114030120431 in words is "one hundred fourteen billion, thirty million, one hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •