Base | Representation |
---|---|
bin | 110101000101100000… |
… | …0011111101001111010 |
3 | 101220020221120201001211 |
4 | 1222023000133221322 |
5 | 3331433313444003 |
6 | 124212123433334 |
7 | 11144026111132 |
oct | 1521300375172 |
9 | 356227521054 |
10 | 114001312378 |
11 | 44390850348 |
12 | 1a11698584a |
13 | a99a48aa75 |
14 | 5736799ac2 |
15 | 2e7352b96d |
hex | 1a8b01fa7a |
114001312378 has 4 divisors (see below), whose sum is σ = 171001968570. Its totient is φ = 57000656188.
The previous prime is 114001312309. The next prime is 114001312379. The reversal of 114001312378 is 873213100411.
114001312378 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 873213100411 = 2161 ⋅404078251.
It can be written as a sum of positive squares in only one way, i.e., 90759395169 + 23241917209 = 301263^2 + 152453^2 .
It is not an unprimeable number, because it can be changed into a prime (114001312379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28500328093 + ... + 28500328096.
Almost surely, 2114001312378 is an apocalyptic number.
114001312378 is a deficient number, since it is larger than the sum of its proper divisors (57000656192).
114001312378 is an equidigital number, since it uses as much as digits as its factorization.
114001312378 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57000656191.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 114001312378 its reverse (873213100411), we get a palindrome (987214412789).
The spelling of 114001312378 in words is "one hundred fourteen billion, one million, three hundred twelve thousand, three hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •