Search a number
-
+
114040352003330 = 2531735974874449
BaseRepresentation
bin11001111011100000010110…
…101010111101010100000010
3112221210011002012122122100002
4121323200112222331110002
5104421414120103101310
61042313225305200002
733010100143063364
oct3173402652752402
9487704065578302
10114040352003330
1133378272753145
121095994b190002
134b82c6105742c
1420238224bad34
15d2b6b8036da5
hex67b816abd502

114040352003330 has 16 divisors (see below), whose sum is σ = 205920181351800. Its totient is φ = 45472241302272.

The previous prime is 114040352003329. The next prime is 114040352003341. The reversal of 114040352003330 is 33300253040411.

It can be written as a sum of positive squares in 4 ways, for example, as 66622929070369 + 47417422932961 = 8162287^2 + 6886031^2 .

It is a junction number, because it is equal to n+sod(n) for n = 114040352003293 and 114040352003302.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17987434055 + ... + 17987440394.

Almost surely, 2114040352003330 is an apocalyptic number.

114040352003330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

114040352003330 is a deficient number, since it is larger than the sum of its proper divisors (91879829348470).

114040352003330 is a wasteful number, since it uses less digits than its factorization.

114040352003330 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 35974874773.

The product of its (nonzero) digits is 12960, while the sum is 29.

The spelling of 114040352003330 in words is "one hundred fourteen trillion, forty billion, three hundred fifty-two million, three thousand, three hundred thirty".

Divisors: 1 2 5 10 317 634 1585 3170 35974874449 71949748898 179874372245 359748744490 11404035200333 22808070400666 57020176001665 114040352003330