Base | Representation |
---|---|
bin | 101011001101110… |
… | …0001000110001111 |
3 | 10202001112101011212 |
4 | 1112123201012033 |
5 | 10432203212111 |
6 | 355515405035 |
7 | 50635153526 |
oct | 12633410617 |
9 | 3661471155 |
10 | 1450054031 |
11 | 684577068 |
12 | 34575377b |
13 | 1a155564a |
14 | da8214bd |
15 | 8748098b |
hex | 566e118f |
1450054031 has 8 divisors (see below), whose sum is σ = 1462273200. Its totient is φ = 1437875712.
The previous prime is 1450054019. The next prime is 1450054061. The reversal of 1450054031 is 1304500541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1450054031 - 26 = 1450053967 is a prime.
It is a super-2 number, since 2×14500540312 = 4205313385638697922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1450053988 and 1450054006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1450054061) 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, 63281 + ... + 83093.
It is an arithmetic number, because the mean of its divisors is an integer number (182784150).
Almost surely, 21450054031 is an apocalyptic number.
1450054031 is a deficient number, since it is larger than the sum of its proper divisors (12219169).
1450054031 is a wasteful number, since it uses less digits than its factorization.
1450054031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20425.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 1450054031 is about 38079.5749844979. The cubic root of 1450054031 is about 1131.8652544210.
Adding to 1450054031 its reverse (1304500541), we get a palindrome (2754554572).
The spelling of 1450054031 in words is "one billion, four hundred fifty million, fifty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •